Metraipolis › archive › dc_fb53d4547c22

A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces — arXiv:2609.12009

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12009
License (as archived)
CC0-1.0
Archived
2026-10-16T03:49:12.996Z
SHA-256 of the archived text
00ef4fb2471be70847a8d390895da950d565e1598a2027e58ad3a531ddfa8a7a
Stable URL of this page
https://metraipolis.com/documento/dc_fb53d4547c22

How to cite

A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces — arXiv:2609.12009 — arXiv (en), https://arxiv.org/abs/2609.12009 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb53d4547c22 (Metraipolis archive dc_fb53d4547c22, sha256 00ef4fb2471be70847a8d390895da950d565e1598a2027e58ad3a531ddfa8a7a)
BibTeX
@misc{dcfb53d4547c22,
  title = {A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces — arXiv:2609.12009},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12009},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb53d4547c22; sha256 00ef4fb2471be70847a8d390895da950d565e1598a2027e58ad3a531ddfa8a7a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12009. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove the Tratnik--Ye conjecture that every connected component of a resonance graph of perfect matchings on a closed surface is median whenever the allowed even faces form a proper subset of all faces. The embedding need not be cellular or strong, and the graph need not be bipartite. We also show that the quotient associated with each face is a tree and that these quotients give an isometric embedding of each component into a Cartesian product of trees. This yields a criterion for the facial parity embedding into a hypercube to be isometric.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.12009 — 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-16T03:18:59.195Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).