2021
DOI: 10.48550/arxiv.2104.02296
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The combinatorics of a tree-like functional equation for connected chord diagrams

Lukas Nabergall

Abstract: We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating functions of two different subsets of weighted connected chord diagrams: arbitrary diagrams and diagrams forbidding so-called top cycle subdiagrams. These equations generalize the classic specification for increasing ordered trees and their solution uses a novel decomposition, s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(10 citation statements)
references
References 48 publications
0
10
0
Order By: Relevance
“…contributions [4,6]. The chord diagram expansion also singled out certain parameters on rooted connected chord diagrams, the terminal chords, see below, which had not had substantial study in the past 2 but are interesting in their distribution [4], and correspond to reasonable parameters on other combinatorial objects such as vertices in bridgeless combinatorial maps [5], and lead to interesting enumerative questions and results [1,45]. These expansions rejuvenated the pure combinatorial study of chord diagrams.…”
Section: Chord Diagramsmentioning
confidence: 99%
See 4 more Smart Citations
“…contributions [4,6]. The chord diagram expansion also singled out certain parameters on rooted connected chord diagrams, the terminal chords, see below, which had not had substantial study in the past 2 but are interesting in their distribution [4], and correspond to reasonable parameters on other combinatorial objects such as vertices in bridgeless combinatorial maps [5], and lead to interesting enumerative questions and results [1,45]. These expansions rejuvenated the pure combinatorial study of chord diagrams.…”
Section: Chord Diagramsmentioning
confidence: 99%
“…The Hopf algebra H introduced so far is not yet sufficiently general to capture a Dyson-Schwinger equation of type (1), because it contains only a single cocycle B + . We generalize it to a family of Hopf algebras H(D), where the elements of D are called decorations.…”
Section: Algebraic Set Upmentioning
confidence: 99%
See 3 more Smart Citations