Analytic combinatorics of chord and hyperchord diagrams with k crossings
Visualitza/Obre
Cita com:
hdl:2117/85728
Tipus de documentArticle
Data publicació2014-05-07
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
ProjecteCOUNTGRAPH - Enumeration of discrete structures: algebraic, analytic, probabilistic and algorithmic methods for enriched planar graphs and planar maps (EC-FP7-630749)
EXPLOREMAPS - Combinatorial methods, from enumerative topology to random discrete structures and compact data representations. (EC-FP7-208471)
EXPLOREMAPS - Combinatorial methods, from enumerative topology to random discrete structures and compact data representations. (EC-FP7-208471)
Abstract
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function of the configurations with exactly k crossings as a rational function of the generating function of crossing-free configurations. Using these expressions, we study the singular behavior of these generating functions and derive asymptotic results on the counting sequences of the configurations with precisely k crossings. Limiting distributions and random generators are also studied.
CitacióPilaud, V., Rue, J. Analytic combinatorics of chord and hyperchord diagrams with k crossings. "Advances in applied mathematics", 07 Maig 2014, vol. 57, p. 60-100.
ISSN0196-8858
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
PilaudRueQuasiPlanarFamilies.pdf | 512,3Kb | Visualitza/Obre |