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

DOI10.5070/c63362791arXiv2104.02296MaRDI QIDQ6204690

Lukas Nabergall

Publication date: 2 April 2024

Published in: Combinatorial Theory (Search for Journal in Brave)

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

zbMATH Keywords

triangulationsperfect matchingspattern avoidancechord diagramscombinatorial mapsCatalan posetscombinatorial classesuniquely sorted permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Generalized Stirling permutations, families of increasing trees and urn models
• Patterns in permutations and words.
• Terminal chords in connected chord diagrams
• Stack-sorting, set partitions, and Lassalle's sequence
• Dyck paths and pattern-avoiding matchings
• Classification of systems of Dyson-Schwinger equations in the Hopf algebra of decorated rooted trees.
• Intervals in Catalan lattices and realizers of triangulations
• Right-arm rotation distance between binary trees
• New bijective links on planar maps via orientations
• Reconnaissance des graphes de cordes
• Standard Young tableaux of height 4 and 5
• The enumeration of connected graphs and linked diagrams
• Counting rooted maps by genus. III: Nonseparable maps
• Stirling polynomials
• On a class of linked diagrams. I: Enumeration
• The number of Baxter permutations
• Combinatorics of RNA secondary structures
• Hopf algebras, renormalization and noncommutative geometry
• On the Hopf algebra strucutre of perturbative quantum field theories
• Circle graph obstructions
• Planar triangulations, bridgeless planar maps and Tamari intervals
• On \(abab\)-free and \(abba\)-free set partitions
• Pattern avoidance in matchings and partitions
• Connected chord diagrams and bridgeless maps
• Generalized chord diagram expansions of Dyson-Schwinger equations
• The representation of the symmetric group on \(m\)-Tamari intervals
• General Dyson-Schwinger equations and systems
• A chord diagram expansion coming from some Dyson-Schwinger equations
• Faà di Bruno subalgebras of the Hopf algebra of planar trees from combinatorial Dyson-Schwinger equations.
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• A unifying approach for proving hook-length formulas for weighted tree families
• A Combinatorial Perspective on Quantum Field Theory
• Plane recursive trees, Stirling permutations and an urn model
• A Census of Planar Triangulations
• Crossings and nestings of matchings and partitions
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• Linearized chord diagrams and an upper bound for vassiliev invariants
• Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
• Circle graphs are quadratically χ‐bounded
• Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley
• Enumeration of Triangulations of the Disk
• Level of nodes in increasing trees revisited
• Sur Un Problème De Configurations Et Sur Les Fractions Continues

This page was built for publication: The combinatorics of a tree-like functional equation for connected chord diagrams