15847 articles – 31984 references  [version française]
HAL: hal-00655531, version 1

Detailed view  Export this paper
Constellations and multicontinued fractions: application to Eulerian triangulations
Marie Albenque 1, Jérémie Bouttier 2, 3
(2011-12-29)

We consider the problem of enumerating planar constellations with two points at a prescribed distance. Our approach relies on a combinatorial correspondence between this family of constellations and the simpler family of rooted constellations, which we may formulate algebraically in terms of multicontinued fractions and generalized Hankel determinants. As an application, we provide a combinatorial derivation of the generating function of Eulerian triangulations with two points at a prescribed distance.
1:  Laboratoire d'informatique de l'école polytechnique (LIX)
CNRS : UMR7161 – Polytechnique - X
2:  Institut de Physique Théorique (ex SPhT) (IPHT)
CNRS : URA2306 – CEA : DSM/IPHT
3:  Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA)
CNRS : UMR7089 – Université Paris VII - Paris Diderot
Mathematics/Combinatorics

Physics/Mathematical Physics

Mathematics/Mathematical Physics
Constellations – planar maps – Eulerian triangulations – continued fractions – lattice paths
Fulltext link: 
http://fr.arXiv.org/abs/1112.6379