Terminal chords in connected chord diagrams

DOI10.4171/AIHPD/44zbMATH Open1385.05018arXiv1603.08596MaRDI QIDQ679656FDOQ679656

Authors: Julien Courtiel, Karen Yeats 

Publication date: 19 January 2018

Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

Abstract: Rooted connected chord diagrams form a nice class of combinatorial objects. Recently they were shown to index solutions to certain Dyson-Schwinger equations in quantum field theory. Key to this indexing role are certain special chords which are called terminal chords. Terminal chords provide a number of combinatorially interesting parameters on rooted connected chord diagrams which have not been studied previously. Understanding these parameters better has implications for quantum field theory. Specifically, we show that the distributions of the number of terminal chords and the number of adjacent terminal chords are asymptotically Gaussian with logarithmic means, and we prove that the average index of the first terminal chord is $2n/3$. Furthermore, we obtain a method to determine any next-to${}^i$ leading log expansion of the solution to these Dyson-Schwinger equations, and have asymptotic information about the coefficients of the log expansions.

Full work available at URL: https://arxiv.org/abs/1603.08596

Recommendations

• scientific article; zbMATH DE number 2186979
• scientific article; zbMATH DE number 4073034
• BRAIDED CHORD DIAGRAMS
• scientific article; zbMATH DE number 5038484
• Chordal graphs
• Connected chord diagrams and bridgeless maps
• Linear chord diagrams with long chords
• CHORD DIAGRAMS AND COXETER LINKS
• Chordal probe graphs
• Chord diagram invariants of tangles and graphs

zbMATH Keywords

chord diagramDyson-Schwinger equation, enumerative combinatorics, analytic combinatoricsterminal chord

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Asymptotic enumeration (05A16) Feynman diagrams (81T18)

Cited In (12)

• Asymptotic distribution of parameters in random maps
• Weighted dependency graphs
• \( \hbox{Next-to}{}^k\) leading log expansions by chord diagrams
• Connected chord diagrams and bridgeless maps
• A chord diagram expansion coming from some Dyson-Schwinger equations
• Title not available (Why is that?)
• An asymptotic expansion for the number of two-connected chord diagrams
• The combinatorics of a tree-like functional equation for connected chord diagrams
• Tubings, chord diagrams, and Dyson-Schwinger equations
• Connected chord diagrams and the combinatorics of asymptotic expansions
• Generalized chord diagram expansions of Dyson-Schwinger equations
• On a uniformly random chord diagram and its intersection graph

This page was built for publication: Terminal chords in connected chord diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679656)