Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.20008 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915466502471680 |
|---|---|
| author | Pivoteau, Carine Salvy, Bruno |
| author_facet | Pivoteau, Carine Salvy, Bruno |
| contents | Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that allows one to derive precise asymptotic expansions starting from systems of combinatorial equations. In the situation where the combinatorial system involves only cartesian products and disjoint unions, the generating functions satisfy polynomial systems with positivity constraints for which many results and algorithms are known. We extend these results to the general situation. This produces an almost complete algorithmic chain going from combinatorial systems to asymptotic expansions. Thus, it is possible to compute asymptotic expansions of all generating functions produced by the symbolic method of Flajolet and Sedgewick when they have algebraic-logarithmic singularities (which can be decided), under the assumption that Schanuel's conjecture from number theory holds. That conjecture is not needed for systems that do not involve the constructions of sets and cycles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_20008 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Effective Asymptotics of Combinatorial Systems Pivoteau, Carine Salvy, Bruno Combinatorics Symbolic Computation 05A16 Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that allows one to derive precise asymptotic expansions starting from systems of combinatorial equations. In the situation where the combinatorial system involves only cartesian products and disjoint unions, the generating functions satisfy polynomial systems with positivity constraints for which many results and algorithms are known. We extend these results to the general situation. This produces an almost complete algorithmic chain going from combinatorial systems to asymptotic expansions. Thus, it is possible to compute asymptotic expansions of all generating functions produced by the symbolic method of Flajolet and Sedgewick when they have algebraic-logarithmic singularities (which can be decided), under the assumption that Schanuel's conjecture from number theory holds. That conjecture is not needed for systems that do not involve the constructions of sets and cycles. |
| title | Effective Asymptotics of Combinatorial Systems |
| topic | Combinatorics Symbolic Computation 05A16 |
| url | https://arxiv.org/abs/2508.20008 |