Characterizations of bipartite and Eulerian partial duals of orientable hypermaps
Abstract
We first rewrite the Chmutov and Vignes-Tourneret's three-permutation formula as an explicit hyperedge-partial-duality formula in the two-permutation model, and show that in this model partial duality acts exactly by preserving the support and length of every hyperedge while reversing the α-cycles corresponding to the selected hyperedges. Next, using the Cori and Hetyei's construction of the medial map, we define for each hyperedge subset E'⊂eq E(H) a black/white smoothing state SE', and prove rigorously that the state circles of SE' are in bijection with the vertices of the partial dual HE'. Consequently, HE' is Eulerian if and only if every state circle has even length. On this basis we prove the following two main theorems: \[ aligned HE' is Eulerian & ∃ a crossing-total direction Ω of M(H) \\ &3.35emsuch that E'=D(Ω) T', T'⊂eq T(Ω), aligned \] \[ aligned HE' is bipartite & ∃ an all-crossing direction Φ of M(H) \\ &3.35emsuch that E'=C(Φ). aligned \] Here D(Ω), T(Ω) and C(Φ) denote, respectively, the sets of all d-type, t-type and c-type hyperedges. Unlike the ribbon-graph case, the hypermap setting exhibits a genuine new obstruction: if some hyperedge-partial dual is bipartite, then every hyperedge of the original hypermap must have even length.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.