The generating function of planar Eulerian orientations

Abstract

The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in bijection with properly 3-coloured quadrangulations, while in physics they correspond to configurations of the ice model.We solve both problems -namely the enumeration of planar Eulerian orientations and of 4-valent planar Eulerian orientations -by expressing the associated generating functions as the inverses (for the composition of series) of simple hypergeometric series. Using these expressions, we derive the asymptotic behaviour of the number of planar Eulerian orientations, thus proving earlier predictions of Kostov, Zinn-Justin, Elvey Price and Guttmann. This behaviour, µ n /(n log n) 2 , prevents the associated generating functions from being D-finite. Still, these generating functions are differentially algebraic, as they satisfy non-linear differential equations of order 2. Differential algebraicity has recently been proved for other map problems, in particular for maps equipped with a Potts model.Our solutions mix recursive and bijective ingredients. In particular, a preliminary bijection transforms our oriented maps into maps carrying a height function on their vertices. In the 4valent case, we also observe an unexpected connection with the enumeration of maps equipped with a spanning tree that is internally inactive in the sense of Tutte. This connection remains to be explained combinatorially.

On the expected number of perfect matchings in cubic planar graphs

“…Using the gfun package [30] in Maple, from (6) we have been able to find a first order recurrence equation with polynomial coefficients satisfied by the coefficients of B(z) and, after some algebraic manipulations, we obtain the following.…”

“…A consequence of this estimate is that the expected number of perfect matchings grows like a pure exponential γ n , an asymptotic behavior that to our knowledge has not been observed before in this context. An explanation comes from the fact that the associated generating functions are algebraic, whereas those counting global structures on maps mentioned before are D-finite (a function is D-finite, or holonomic, if it is the solution of a linear differential equation with polynomial coefficients) but not algebraic; there are examples which are not even D-finite, like 4-regular maps equipped with an Eulerian orientation, whose growth µ n /(n log n) 2 prevents the associated generating function from being D-finite [6].…”

On the expected number of perfect matchings in cubic planar graphs

“…Using the gfun package [29] in Maple, from (6) we have been able to find a first order recurrence equation with polynomial coefficients satisfied by the coefficients of B(z) and, after some algebraic manipulations, we obtain the following.…”