Connected chord diagrams and bridgeless maps

Julien Courtiel, Karen Yeats, Noam Zeilberger

Research output: Contribution to journalArticlepeer-review

132 Downloads (Pure)


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 Arques and Beraud 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.
Original languageEnglish
Article numberP4.37
Pages (from-to)1-56
Number of pages56
JournalThe Electronic Journal of Combinatorics
Issue number4
Publication statusPublished - 22 Nov 2019

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Connected chord diagrams and bridgeless maps'. Together they form a unique fingerprint.

Cite this