Analytic Combinatorics of Chord Diagrams

Philippe Flajolet () and Marc Noy ()
Additional contact information
Philippe Flajolet: INRIA
Marc Noy: Universitat Politècnica de Catalunya

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 191-201 from Springer

Abstract: 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.

Keywords: Cayley Tree; Large Connected Component; Chord Diagram; Link Diagram; Bell Polynomial (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_17

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().