Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 805-816 |
| Number of pages | 12 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Publication status | Published - 1 Dec 2012 |
| Event | 24th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2012 - Nagoya, Japan Duration: 30 Jul 2012 → 3 Aug 2012 |
Keywords
- Constellations
- Continued fractions
- Eulerian triangulations
- Lattice paths
- Planar maps
Fingerprint
Dive into the research topics of 'Constellations and multicontinued fractions: Application to Eulerian triangulations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver