Search arXivSearch

arXiv · 2511.03680

Blossoming bijection for bipartite maps: a new approach via orientations and applications to the Ising model

Abstract

We develop a new bijective framework for the enumeration of bipartite planar maps with control on the degree distribution of black and white vertices. Our approach builds on the blossoming-tree paradigm, introducing a family of orientations on bipartite maps that extends Eulerian and quasi-Eulerian orientations and connects the bijection of Bousquet-Mélou and Schaeffer to the general scheme of Albenque and Poulalhon. This enables us to generalize the Bousquet-Mélou and Schaeffer's bijection to several families of bipartite maps. As an application, we also derive a rational and Lagrangian parametrization with positive integer coefficients for the generating series of quartic maps equipped with an Ising model, which is key to the probabilistic study of these maps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marie Albenque, Laurent Ménard, Nicolas Tokka. 2025-11-06. Blossoming bijection for bipartite maps: a new approach via orientations and applications to the Ising model. https://arxiv.org/abs/2511.03680

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO