Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 15 min ago
PreprintarXiv licencearXiv

A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces

  • Guangfu Wang
  • Ke Kang
Open at sourcePDFDOICite

Abstract

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.

Related

  1. Resonance counting and spectral gaps for hyperbolic surfaces via Fourier decay
    Louis Soares
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  2. Orlov's rationality conjecture for surfaces
    Xun Lin, Shizhuo Zhang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Generalised Cone Conjecture, III: Non-generic Sakai surfaces
    Vladimir Lazić, Isabel Stenger, Zhixin Xie
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Resonance transformations for the (2,2p+1) minimal string via x−y swap: a proof of Artemev's conjecture
    Kornelis Dekinga, Sergey Shadrin, Erik Verlinde
    arXivPreprintarXiv licenceFull textMathematical physicsHigh-energy & particle physicsarXiv
  5. Topping's diameter conjecture for immersed surfaces
    Tatsuya Miura
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv

Cite

BibTeXRIS
BibTeX
@misc{wang2026proof,
  title = {{A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces}},
  author = {Guangfu Wang and Ke Kang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.12009},
  eprint = {2609.12009},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.12009},
}
RIS
TY  - UNPB
TI  - A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces
AU  - Guangfu Wang
AU  - Ke Kang
PY  - 2026
DA  - 2026/09/10
PB  - arXiv
DO  - 10.48550/arxiv.2609.12009
UR  - https://arxiv.org/abs/2609.12009
AB  - 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.
ER  -