Singular combinatorics
| dc.creator | Flajolet, Philippe | |
| dc.date | 2003-04-28 | |
| dc.date.accessioned | 2026-07-07T04:57:33Z | |
| dc.date.available | 2026-07-07T04:57:33Z | |
| dc.description | Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures. ``Singularity analysis'' reviewed here provides constructive estimates that are applicable in several areas of combinatorics. It constitutes a complex-analytic Tauberian procedure by which combinatorial constructions and asymptotic--probabilistic laws can be systematically related. | |
| dc.identifier | https://arxiv.org/abs/math/0304465 | |
| dc.identifier | http://arxiv.org/abs/math/0304465 | |
| dc.identifier | Proceedings of the ICM, Beijing 2002, vol. 3, 561--572 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67297 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15, 05A16, 30B10, 39B05, 60C05, 60F05, 68Q25 | |
| dc.title | Singular combinatorics | |
| dc.type | text |