Metraipolis › archive › dc_09552f35a76d
Enumeration of one-cycle signed chord diagrams and their duals for optimal Morse flows on closed surfaces — arXiv:2610.19194
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19194
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T21:52:37.653Z
- SHA-256 of the archived text
eef592b6c4c02cf0598b27b9b3b6a1d4777257580213644d4375e24999502a27- Stable URL of this page
https://metraipolis.com/documento/dc_09552f35a76d
How to cite
Enumeration of one-cycle signed chord diagrams and their duals for optimal Morse flows on closed surfaces — arXiv:2610.19194 — arXiv (en), https://arxiv.org/abs/2610.19194 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_09552f35a76d (Metraipolis archive dc_09552f35a76d, sha256 eef592b6c4c02cf0598b27b9b3b6a1d4777257580213644d4375e24999502a27)
BibTeX
@misc{dc09552f35a76d,
title = {Enumeration of one-cycle signed chord diagrams and their duals for optimal Morse flows on closed surfaces — arXiv:2610.19194},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19194},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_09552f35a76d; sha256 eef592b6c4c02cf0598b27b9b3b6a1d4777257580213644d4375e24999502a27},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19194. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Optimal Morse vector fields on closed surfaces, i.e.\ fields with the minimal possible number of critical points (a single source and a single sink), are classified up to topological trajectory equivalence by one-cycle signed chord diagrams in Kybalko, Prishlyak and Shchurko (2018). We recall this construction and the associated duality, which corresponds to reversing the direction of the flow, in a unified encoding in which both endpoints of a chord carry the same label, and we make it algorithmic. We give an explicit traversal procedure that detects one-cycle diagrams, a canonical form of an equivalence class under cyclic shifts, reversal and relabeling of chords, and a construction of the dual diagram. On this basis we describe an algorithm that enumerates all one-cycle signed chord diagrams with a given number of chords, both for orientable and for non-orientable surfaces, groups them into equivalence classes, pairs each class with its dual, and identifies the self-dual ones. The algorithm is implemented in Python and archived in Zenodo; its output is validated against the Harer--Zagier numbers in the orientable case and against orbit-size counts in both cases. We also note that, when a one-cycle diagram is read as a cellular embedding of a one-vertex graph, its dual diagram describes the embedding of the dual graph. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Dynamical Systems (math.DS); Geometric Topology (math.GT). Pagina del lavoro: https://arxiv.org/abs/2610.19194 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T21:37:14.417Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).