Introducing irrational enumeration: analytic combinatorics for objects of irrational size
math.CO
Submitted: 2024-12-19
Updated: 2026-10-27
Comments: 31 pages
Journal ref: Electron. J. Combin. 33(3): P3.15, 2026
DOI: 10.37236/14759
License: http://creativecommons.org/licenses/by/4.0/
The gist: We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes.
Terminology
Abstract
We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A transformation then yields a generalised Dirichlet series from which the asymptotics of the coefficients can be extracted by singularity analysis using an appropriate Tauberian theorem. In practice, the asymptotics can often be determined directly from the original generating function. We illustrate the technique with a variety of applications, including tilings with tiles of irrational area, ordered integer factorizations, lattice walks enumerated by Euclidean length, and plane trees with vertices of irrational size. We also explore phase transitions in the asymptotics of families of irrational combinatorial classes. This revision contains corrections to the statement and proof of Theorem 1, to the statement of Conjecture 6, and to the proof of Proposition 13 that appear in the published version.
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality