# Analytic Combinatorics of Non-crossing Configurations

1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : This paper describes a systematic approach to the enumeration of «non-crossing» geometric configurations built on vertices of a convex $n$-gon in the plane. It relies on generating functions, symbolic methods, singularity analysis, and singularity perturbation. A consequence is exact and asymptotic counting results for trees, forests, graphs, connected graphs, dissections, and partitions. Limit laws of the Gaussian type are also established in this framework; they concern a variety of parameters like number of leaves in trees, number of components or edges in graphs, etc.
Type de document :
Rapport
[Research Report] RR-3196, INRIA. 1997
Domaine :

https://hal.inria.fr/inria-00073493
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:02:32
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : jeudi 24 mars 2011 - 12:51:21

### Identifiants

• HAL Id : inria-00073493, version 1

### Citation

Philippe Flajolet, Marc Noy. Analytic Combinatorics of Non-crossing Configurations. [Research Report] RR-3196, INRIA. 1997. 〈inria-00073493〉

### Métriques

Consultations de la notice

## 89

Téléchargements de fichiers