A genus-preserving chord swap Markov chain on chord diagrams is shown to mix in polynomial time for any fixed genus.
and Zvonkin, Alexander K
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
An algorithmic enumeration method for weighted bi-colored plane trees is developed and applied to compute strong Hurwitz numbers for three-point branch data and the number of connected components in the moduli space of HCMU spheres with one conical singularity.
Partial duals of orientable hypermaps are Eulerian iff they correspond to crossing-total directions on the medial map with E' = D(Ω) ∪ T' (T' ⊆ T(Ω)), and bipartite iff they correspond to all-crossing directions with E' = C(Φ), plus the obstruction that all original hyperedges must have even length
citing papers explorer
-
Polynomial mixing for polygonal side matchings
A genus-preserving chord swap Markov chain on chord diagrams is shown to mix in polynomial time for any fixed genus.