Connected Chord Diagrams and Bridgeless Maps
Open Access
- 11 October 2019
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 26 (4) , P4.37
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. We also give a combinatorial proof to a formula which previously resulted from a technical recurrence, and with similar ideas we prove a conjecture of Hihn. Independently, we revisit an equation due to Arquès and Béraud for the generating function counting rooted maps with respect to edges and vertices, giving a new bijective interpretation of this equation directly on indecomposable chord diagrams, which moreover can be specialized to connected diagrams and refined to incorporate the number of crossings. Finally, we explain how these results have a simple application to the combinatorics of lambda calculus, verifying the conjecture that a certain natural family of lambda terms is equinumerous with bridgeless maps.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- A Combinatorial Perspective on Quantum Field Theory2017
- Indecomposable permutations, hypermaps and labeled Dyck pathsJournal of Combinatorial Theory, Series A, 2009
- A Characterization of the Tutte Polynomial via Combinatorial EmbeddingsAnnals of Combinatorics, 2008
- Vassiliev invariants and a strange identity related to the Dedekind eta-functionTopology, 2001
- On the number of chord diagramsDiscrete Mathematics, 2000
- Rooted maps on orientable surfaces, Riccati's equation and continued fractionsDiscrete Mathematics, 2000
- Combinatoric explosion of renormalization tamed by Hopf algebra: 30-loop Padé-Borel resummationPhysics Letters B, 2000
- Sequence of operations analysis for dynamic data structuresJournal of Algorithms, 1980
- The enumeration of connected graphs and linked diagramsJournal of Combinatorial Theory, Series A, 1979
- On a class of linked diagrams, I. EnumerationJournal of Combinatorial Theory, Series A, 1978