Enumeration of plane hypermaps with a mixed boundary I

Abstract: Plane hypermaps are plane maps endowed with a proper coloration of their inner faces in black or white. We consider the problem of enumerating plane hypermaps with prescribed face degrees and a $k$-alternating boundary condition: by this we mean the colors of inner faces incident to the outer face alternates at most $2k$ times when turning around the hypermap. The present paper deals with the cases $k=1,2$, the general case being left to the forthcoming part II. Our approach relies on the so-called slice decomposition and uses crucially the notion of accessibility, which exploits the canonical orientation of hypermaps and the marking variable $t$ associated with vertices, to enumerate pointed hypermaps by decomposing them according to the set of all vertices that can access to the marked vertex. This process enables us to express the generating functions of hypermaps with mixed boundaries in terms of the generating functions of hypermap slices and to recover, in a purely combinatorial way, some formulas previously obtained through algebraic methods.

• The paper develops a bijective slice-decomposition method using accessibility and vertex marking to enumerate plane hypermaps with prescribed face degrees and alternating boundaries.
• For one alternating boundary, it recovers generating functions involving the spectral curve and proves the classical formula for all hypermaps through bridge and strongly connected decompositions.
• For two alternating boundaries, it derives a determinantal formula and identifies open problems involving general boundary numbers, higher genus, unbounded degrees, and bijective proofs of the Poisson identity.

Overview

This paper, by Bouttier, Eynard, and Lejeune (2608.19947), develops a purely combinatorial approach to the enumeration of plane hypermaps—plane maps whose edges are oriented so that every inner face contour forms a directed cycle, equivalently properly face-bicolored maps—with prescribed face degrees and a $k$-alternating boundary condition. The latter means that the outer face carries $2k$ marked corners $c_0,\dots,c_{2k}$ such that boundary intervals alternate between counter-clockwise and clockwise directed paths. The paper treats $k=1$ and $k=2$ explicitly; the general case is deferred to a companion paper.

The central motivation is to give bijective proofs of formulas previously obtained through algebraic methods: Tutte-style edge-removal recursions were converted into loop equations and solved in terms of a genus-zero spectral curve $E(x,y)=0$ with rational parametrization $(x(z),y(z))$, yielding explicit expressions for mixed-boundary generating functions in Eynard's work and its successors. The authors rederive these expressions combinatorially via slice decomposition, using as the key new device the notion of accessibility together with the vertex-marking variable $t$. Beyond enumerative interest, hypermaps are tied to the two-matrix model and the Ising model on random maps, whose critical behavior (expected to be governed by Liouville quantum gravity at central charge $c=1/2$) remains an open rigorous problem; a sharper combinatorial understanding of hypermaps is presented as groundwork toward that program.

Structural lemmas on bridges and accessibility

The technical foundation is a simple planarity lemma: if two vertices of a plane hypermap are joined by a non-directed path avoiding bridges, then they are joined by a directed path. The proof replaces each wrongly oriented edge along the path by a detour along the directed contour of an incident inner face. Two consequences follow. First, a plane hypermap is strongly connected (every vertex reaches every other) if and only if it contains no bridge—a characterization that fails outside the plane setting or when inner faces are not directed cycles, as the authors illustrate with explicit counterexamples. Second, accessibility of a vertex $v$ can be checked from vertices incident to the outer face alone, and even from the inward corners only (outer corners with two incoming outer edges). These reductions underpin all subsequent decompositions.

Accessibly pointed hypermaps and slices

The paper generalizes the slices of type $2k$0 and $2k$1 introduced in prior work: a slice has three distinguished corners $2k$2 with left and right sides being geodesics ending at an accessible apex $2k$3, and a base $2k$4 carrying an orientation word in $2k$5. Elementary slices (base word of length one) have generating functions $2k$6 determined recursively by the Laurent series

$2k$7

whose coefficients satisfy coupled recursions identical to those arising algebraically in the loop-equation approach—the combinatorial interpretation of the spectral curve parametrization.

The main structural result is a weight-preserving bijection between accessibly pointed $2k$8-alternating hypermaps with prescribed boundary interval lengths $2k$9 and slices with base word $c_0,\dots,c_{2k}$0 whose left and right sides have equal length. Combined with the fact that any slice decomposes into a sequence of elementary slices according to its base word, this yields the first main theorem:

$c_0,\dots,c_{2k}$1

where $c_0,\dots,c_{2k}$2 counts accessibly pointed $c_0,\dots,c_{2k}$3-alternating hypermaps. A notable feature, emphasized by the authors, is the full symmetry of $c_0,\dots,c_{2k}$4 under arbitrary permutations of the pairs $c_0,\dots,c_{2k}$5—a symmetry not forced by the combinatorial definition, which only predicts cyclic rotation and reflection invariance. A partial-fraction corollary expresses $c_0,\dots,c_{2k}$6 in terms of the one-boundary function $c_0,\dots,c_{2k}$7; the $c_0,\dots,c_{2k}$8 specialization plays a decisive role later.

The case $c_0,\dots,c_{2k}$9

For $k=1$0-alternating hypermaps (Dobrushin-type boundaries), the paper establishes the chain of relations

$k=1$1

where $k=1$2 and $k=1$3 count respectively all and strongly connected $k=1$4-alternating hypermaps. Both identities come from bijective decompositions of pointed hypermaps along the last bridge obstructing accessibility: in the first, a pointed hypermap splits into an accessibly pointed component plus an unpointed remainder; in the second, the accessible component of the marked vertex is strongly connected, and the rest is a sequence of strongly connected components glued by bridges. Integrating gives $k=1$5 and the exponential formula

$k=1$6

recovering a known result by a new route.

A key auxiliary result is a Poisson formula for the slice parametrization,

$k=1$7

proved analytically via the compositional inverses $k=1$8, $k=1$9 of $k=2$0 and $k=2$1 and derivative relations for monochromatic-boundary generating functions. The authors note that a bijective proof of this identity would be desirable. Using it, $k=2$2 is rewritten as a $k=2$3-derivative of a logarithmic expression, eliminating the integral over $k=2$4 that would otherwise obscure the algebraic nature of the answer.

Under bounded face degrees, $k=2$5 and $k=2$6 become Laurent polynomials, and their resultant defines the spectral curve $k=2$7. A partial fraction decomposition over the small roots ($k=2$8, $k=2$9) and large roots ($E(x,y)=0$0, $E(x,y)=0$1), combined with the Poisson formula, yields

$E(x,y)=0$2

which integrates to the classical formula $E(x,y)=0$3—here obtained without Tutte's edge-removal method. An appendix gives a third proof of the monochromatic-boundary formula $E(x,y)=0$4, $E(x,y)=0$5, valid in full generality by a coefficient-matching argument that reduces bounded-degree identities to the unrestricted ring.

The case $E(x,y)=0$6

For pointed $E(x,y)=0$7-alternating hypermaps, the decomposition distinguishes whether the outward corners $E(x,y)=0$8 can reach the marked vertex. Planarity forces exactly three cases: both reach it (contributing $E(x,y)=0$9), only $(x(z),y(z))$0 does (contributing $(x(z),y(z))$1), or only $(x(z),y(z))$2 does (symmetrically $(x(z),y(z))$3); the case where neither reaches it cannot occur because the obstruction would require a bridge on a boundary interval containing no inward corner. This yields the differential equation

$(x(z),y(z))$4

which, after substituting the partial-fraction form of $(x(z),y(z))$5 and recognizing a total derivative, integrates to the determinantal formula

$(x(z),y(z))$6

matching Corollary 8.4.1 of the algebraic treatment and providing the requested combinatorial proof. Finally, peeling off bridges separating each pair of opposite marked corners decomposes $(x(z),y(z))$7 into four monochromatic factors times the strongly connected part:

$(x(z),y(z))$8

from which the dual determinantal expression for $(x(z),y(z))$9 follows immediately.

Limitations and open questions

Several restrictions are stated plainly. The general-$t$0 formulas for $t$1 and $t$2 are not established here; the differential decomposition of Lemma 5.1 relies on case analysis specific to $t$3, and its generalization is deferred to the sequel. The spectral-curve identity for $t$4 requires bounded face degrees so that $t$5 and $t$6 are Laurent polynomials; unbounded degree is handled only indirectly via a formal reduction lemma. The Poisson formula is proved analytically rather than bijectively, and the authors flag a bijective interpretation as an open question. All results are confined to genus zero; extension to higher genus, where topological recursion provides algebraic predictions lacking combinatorial interpretations, remains open, as do asymptotic consequences for distance distributions in hypermaps.

Conclusion

The paper demonstrates that the vertex-marking variable $t$7 and the accessibility structure of plane hypermaps suffice to rederive, bijectively, the algebraic generating-function formulas for hypermaps with one and two alternating boundary intervals. The bijection between accessibly pointed hypermaps and equal-sided slices with prescribed base words is the load-bearing combinatorial object, and it simultaneously explains the unexpected permutation symmetry of $t$8. The framework extends naturally in principle to arbitrary $t$9, higher genus, and asymptotic analysis, each of which constitutes a concrete open direction left open by this work.