On the number of planar Eulerian orientations
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2016
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910907602305024 |
|---|---|
| author | Bonichon, Nicolas Bousquet-Mélou, Mireille Dorbec, Paul Pennarun, Claire |
| author_facet | Bonichon, Nicolas Bousquet-Mélou, Mireille Dorbec, Paul Pennarun, Claire |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1610_09837 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | On the number of planar Eulerian orientations Bonichon, Nicolas Bousquet-Mélou, Mireille Dorbec, Paul Pennarun, Claire Combinatorics 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. |
| title | On the number of planar Eulerian orientations |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1610.09837 |