On the number of planar Eulerian orientations
From MaRDI portal
Publication:2400972
Abstract: The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count families of subsets and supersets of planar Eulerian orientations, indexed by an integer k, that converge to the set of all planar Eulerian orientations as k increases. The generating functions of our subsets can be characterized by systems of polynomial equations, and are thus algebraic. The generating functions of our supersets are characterized by polynomial systems involving divided differences, as often occurs in map enumeration. We prove that these series are algebraic as well. We obtain in this way lower and upper bounds on the growth rate of planar Eulerian orientations, which appears to be around 12.5.
Recommendations
Cites work
- scientific article; zbMATH DE number 3882458 (Why is no real title available?)
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- scientific article; zbMATH DE number 1405838 (Why is no real title available?)
- A Census of Planar Maps
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- A course in combinatorics.
- Algebraic approximants: a new method of series analysis
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- Analytic combinatorics
- Baxter permutations and plane bipolar orientations
- Bijections for Baxter families and related objects
- Bijective counting of involutive Baxter permutations
- Bijective counting of plane bipolar orientations and Schnyder woods
- Blocked edges on Eulerian maps and mobiles: application to spanning trees, hard particles and the Ising model
- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
- Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
- Chromatic sums revisited
- Counting colored planar maps: algebraicity results
- Counting colored random triangulations
- Counting coloured planar maps: differential equations
- Counting polyominoes on twisted cylinders
- Dichromatic polynomials and Potts models summed over rooted maps
- Effect of confinement: polygons in strips, slabs and rectangles
- Enumeration of planar constellations
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Exact solution of the six-vertex model on a random lattice.
- GFUN
- General Néron desingularization and approximation
- Improved upper bounds for self-avoiding walks in Z^d
- Intervals in Catalan lattices and realizers of triangulations
- Lattice structures from planar graphs
- Loop models on random maps via nested loops: the case of domain symmetry breaking and application to the Potts model
- On the Enumeration of Tree-Rooted Maps
- On the enumeration of planar maps
- On the existence of square roots in certain rings of power series
- Optimal coding and sampling of triangulations
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Random geometry on the sphere
- Random self-avoiding walks on one-dimensional lattices
- Succinct representations of planar maps
- The Potts-\(q\) random matrix model: Loop equations, critical exponents, and rational case.
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Universal exponents and tail estimates in the enumeration of planar maps
Cited in
(8)- On the number of planar orientations with prescribed degrees
- On the Number of α-Orientations
- Counting planar Eulerian orientations
- Asymptotic enumeration of orientations
- The six-vertex model on random planar maps revisited
- Eulerian orientations and the six-vertex model on planar maps
- Inhomogeneous restricted lattice walks
- The generating function of planar Eulerian orientations
This page was built for publication: On the number of planar Eulerian orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400972)
