Analytic Combinatorics of Chord Diagrams

Philippe Flajolet 1 Marc Noy
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : In this paper we study the enumeration of diagrams of n chords joining 2n points on a circle in disjoint pairs. We establish limit laws for the following three parameters: number of components, size of the largest component, and number of crossings. We also find exact formulas for the moments of the distribution of number of components and number of crossings.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00072739
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:46:18 AM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Thursday, March 24, 2011 - 12:16:01 PM

Identifiers

  • HAL Id : inria-00072739, version 1

Collections

Citation

Philippe Flajolet, Marc Noy. Analytic Combinatorics of Chord Diagrams. [Research Report] RR-3914, INRIA. 2000. ⟨inria-00072739⟩

Share

Metrics

Record views

182

Files downloads

314