Connected chord diagrams and bridgeless maps
Authors:
Preprint
Abstract
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two classes, which naturally extends to indecomposable diagrams and general rooted maps. As an application, this bijection provides a simplifying framework for some technical quantum field theory work realized by some of the authors. Most notably, an important but technical parameter naturally translates to vertices at the level of maps. Finally, we give a new interpretation of a famous equation due to Arqu\`es and B\'eraud, which characterizes the generating function of rooted maps, in terms of indecomposable chord diagrams. This interpretation can be specialized to connected diagrams, and refined to incorporate the number of crossings.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Terminal chords in connected chord diagramsAnnales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions, 2017
- A chord diagram expansion coming from some Dyson-Schwinger equationsCommunications in Number Theory and Physics, 2013
- Indecomposable permutations, hypermaps and labeled Dyck pathsJournal of Combinatorial Theory, Series A, 2009
- Generalized Dyck equations and multilabel treesDiscrete Mathematics, 2005
- Rooted maps on orientable surfaces, Riccati's equation and continued fractionsDiscrete Mathematics, 2000
- The enumeration of connected graphs and linked diagramsJournal of Combinatorial Theory, Series A, 1979
- Sur Un Problème De Configurations Et Sur Les Fractions ContinuesCanadian Journal of Mathematics, 1952