Terminal chords in connected chord diagrams

DOI10.4171/AIHPD/44MaRDI QIDQ679656zbMATH OpenFDO

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)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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.

Review text

A chord diagram with \(n\) chords is a perfect matching of the set \(\{1,2,\dots,2n\}\). The oriented intersection graph of a chord diagram \(C\) is the digraph with a vertex for each chord of \(C\) and an oriented edge from chord \(\{a,b\}\) to chord \(\{c,d\}\) whenever \(a<c<b<d\). A chord is terminal if its vertex in the oriented intersection graph has no outgoing edges. Chord diagrams are connected if their oriented intersection graphs are connected. It is known that rooted connected chord diagrams index solutions to certain Dyson-Schwinger equations from quantum field theory. In this paper, the authors study some parameters chracterizing combinatorial properties of rooted connected chord diagrams. Some results are stated in terms of probabilistic limit theorems under the assumption that the underlying diagrams are selected uniformly at random. From the authors' abstract: ``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 the next-to\(^i\) leadinng \(\log\) expansion of the solution to these Dyson-Schwinger equations, and have asymptotic information about the coefficients of the \(\log\) expansions.

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

Cited in

(12)

• Weighted dependency graphs
• \( \hbox{Next-to}{}^k\) leading log expansions by chord diagrams
• Connected chord diagrams and bridgeless maps
• Generalized chord diagram expansions of Dyson-Schwinger equations
• On a uniformly random chord diagram and its intersection graph
• A chord diagram expansion coming from some Dyson-Schwinger equations
• Asymptotic distribution of parameters in random maps
• Connected chord diagrams and the combinatorics of asymptotic expansions
• scientific article; zbMATH DE number 5038484 (Why is no real title available?)
• 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

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)