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 a black/white smoothing state , and prove rigorously that the state circles of are in bijection with the vertices of the partial dual . Consequently, is Eulerian if and only if every state circle has even length. On this basis we prove the following two main theorems: Here , and denote, respectively, the sets of all -type, -type and -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.

生成讲解博客的中文版本

生成AI智能校验的中文版本