Cycle-Structure Generating Functions for Special Breakpoint Graphs

• URL: http://arxiv.org/abs/2608.30764v1
• Date: Mon, 31 Aug 2026 13:29:37 GMT
• Title: Cycle-Structure Generating Functions for Special Breakpoint Graphs
• Abstract summary: Breakpoint graphs originate in comparative genomics, where their alternating cycles encode relationships between genomes.<n>We study a constrained class of three-colored breakpoint graphs associated with permutations and develop cycle-refined generating functions for two extremal families.<n>The results determine the leading and constant-order moments entering the Rényi entropy expansion, with the projective-plane contribution giving the finite-size constant correction.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Breakpoint graphs originate in comparative genomics, where their alternating cycles encode relationships between genomes. We study a constrained class of three-colored breakpoint graphs associated with permutations and develop cycle-refined generating functions for two extremal families. These families have a natural topological interpretation: their canonical surfaces are, respectively, the sphere and the projective plane. The spherical family is characterized by noncrossing configurations, while the projective-plane family admits a different decomposition involving a distinguished family of Möbius ladders. The resulting generating-function equations retain the full cycle structure but nevertheless admit substantial reductions. This leads to explicit Catalan-weighted evaluations, polynomiality results for refined cycle statistics, and a connection between a natural diagonal specialization and noncrossing trees. The two topological families exhibit markedly different combinatorial mechanisms, providing complementary examples of how local transformations of breakpoint graphs can control refined permutation enumerations. As a further application, the same Catalan-weighted sums arise in asymptotic unitary-Weingarten expansions for entanglement of random Gaussian states in linear optics. The combinatorial results determine the leading and constant-order moment polynomials entering the Rényi entropy expansion, with the projective-plane contribution giving the finite-size constant correction.

Related papers

• "More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks [0.0]
  We represent Canonical neural circuit motifs and their compositions as finite transformation systems.<n>We analyze the transition monoids generated by their input-conditioned updates.
  arXiv  Detail & Related papers  (2026-08-31T04:36:37Z)
• Graph Structure of Chebyshev Permutation Polynomials over Binary and Ternary Adic Rings [6.769253525763681]
  We investigate the graph structure of Chebyshev permutations over the ring $bbZ_2k13k$.<n>We show that, despite the complexities introduced by the binary and ternary components, the graph exhibits strong regularities.<n>Our results extend previous studies over prime-power rings, offering insights into the emergence of complexity in digital nonlinear maps.
  arXiv  Detail & Related papers  (2026-05-20T23:39:55Z)
• Local Equivalence Classes of Distance-Hereditary Graphs using Split Decompositions [0.0]
  Local complement is a graph operation which replaces the neighborhood of a chosen edge-complement with its edge-complement.<n> determining the size of the resulting equivalence classes is a challenging problem in general.<n>We extend these results by deriving explicit formulas for several broad families of distance-hereditary graphs.
  arXiv  Detail & Related papers  (2026-02-27T09:07:41Z)
• Relative Representations: Topological and Geometric Perspectives [50.85040046976025]
  Relative representations are an established approach to zero-shot model stitching.<n>We introduce a normalization procedure in the relative transformation, resulting in invariance to non-isotropic rescalings and permutations.<n>Second, we propose to deploy topological densification when fine-tuning relative representations, a topological regularization loss encouraging clustering within classes.
  arXiv  Detail & Related papers  (2024-09-17T08:09:22Z)
• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Dynamical chaos in nonlinear Schr\"odinger models with subquadratic power nonlinearity [137.6408511310322]
  We deal with a class of nonlinear Schr"odinger lattices with random potential and subquadratic power nonlinearity. We show that the spreading process is subdiffusive and has complex microscopic organization. The limit of quadratic power nonlinearity is also discussed and shown to result in a delocalization border.
  arXiv  Detail & Related papers  (2023-01-20T16:45:36Z)
• Frames for Graph Signals on the Symmetric Group: A Representation Theoretic Approach [0.0]
  We study a class of frames, called Frobenius-Schur frames, where every atom belongs to the coefficient space of only one irreducible representation of the symmetric group. We provide a characterization for all Frobenius-Schur frames on the group algebra of the symmetric group which are "compatible" with respect to the generating set. Our results generalize frame constructions for the permutahedron to any inverse-closed generating set.
  arXiv  Detail & Related papers  (2022-03-06T19:41:36Z)
• Heterogeneous manifolds for curvature-aware graph embedding [6.3351090376024155]
  Graph embeddings are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space matches that of the graph.
  arXiv  Detail & Related papers  (2022-02-02T18:18:35Z)
• Adversarial Graph Disentanglement [47.27978741175575]
  A real-world graph has a complex topological structure, which is often formed by the interaction of different latent factors. We propose an underlinetextbfAdversarial underlinetextbfDisentangled underlinetextbfGraph underlinetextbfConvolutional underlinetextbfNetwork (ADGCN) for disentangled graph representation learning.
  arXiv  Detail & Related papers  (2021-03-12T14:11:36Z)
• Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees [106.91654068632882]
  We consider the bipartite graph and formalize its representation learning problem as a statistical estimation problem of parameters in a semiparametric exponential family distribution. We show that the proposed objective is strongly convex in a neighborhood around the ground truth, so that a gradient descent-based method achieves linear convergence rate. Our estimator is robust to any model misspecification within the exponential family, which is validated in extensive experiments.
  arXiv  Detail & Related papers  (2020-03-02T16:40:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.