Introducing irrational enumeration: analytic combinatorics for objects of irrational size
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917161322151936 |
|---|---|
| author | Bevan, David Condé, Julien |
| author_facet | Bevan, David Condé, Julien |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_14682 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Introducing irrational enumeration: analytic combinatorics for objects of irrational size Bevan, David Condé, Julien Combinatorics 05A15, 05A16, 13F25, 30B50 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. |
| title | Introducing irrational enumeration: analytic combinatorics for objects of irrational size |
| topic | Combinatorics 05A15, 05A16, 13F25, 30B50 |
| url | https://arxiv.org/abs/2412.14682 |