Corpus ID: 235422516

Subdivergence-free gluings of trees

@inproceedings{Dai2021SubdivergencefreeGO,
  title={Subdivergence-free gluings of trees},
  author={Xinle Dai and Jordan B. Long and K. Yeats},
  year={2021}
}
A gluing of two rooted trees is an identification of their leaves and un-subdivision of the resulting 2-valent vertices. A gluing of two rooted trees is subdivergence free if it has no 2-edge cuts with both roots on the same side of the cut. The problem and language is motivated by quantum field theory. We enumerate subdivergence-free gluings for certain families of trees, showing a connection with connected permutations, and we give algorithms to compute subdivergence-free gluings. 
1 Citations
Algebraic Interplay between Renormalization and Monodromy
We investigate combinatorial and algebraic aspects of the interplay between renormalization and monodromies for Feynman amplitudes. We clarify how extraction of subgraphs from a Feynman graphExpand

References

SHOWING 1-10 OF 10 REFERENCES
Algebraic Interplay between Renormalization and Monodromy
We investigate combinatorial and algebraic aspects of the interplay between renormalization and monodromies for Feynman amplitudes. We clarify how extraction of subgraphs from a Feynman graphExpand
Mating of discrete trees and walks in the quarter-plane
Abstract. We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance ofExpand
Towards a more algebraic footing for quantum field theory
The predictions of the standard model of particle physics are highly successful in spite of the fact that several parts of the underlying quantum field theoretical framework are analyticallyExpand
Mating of trees for random planar maps and Liouville quantum gravity: a survey
We survey the theory and applications of mating-of-trees bijections for random planar maps and their continuum analog: the mating-of-trees theorem of Duplantier, Miller, and Sheffield (2014). TheExpand
Graphs in Perturbation Theory: Algebraic Structure and Asymptotics
This thesis provides an extension of the work of Dirk Kreimer and Alain Connes on the Hopf algebra structure of Feynman graphs and renormalization to general graphs. Additionally, an algebraicExpand
A Combinatorial Perspective on Quantum Field Theory
Part I Preliminaries -- Introduction -- Quantum field theory set up -- Combinatorial classes and rooted trees -- The Connes-Kreimer Hopf algebra -- Feynman graphs -- Part II Dyson-Schwinger equationsExpand
Cutkosky Rules and Outer Space
We derive Cutkosky's theorem starting from Pham's classical work. We emphasize structural relations to Outer Space.
Irreducible and connected permutations
A permutation π of [n] = {1, 2, . . . , n} is irreducible if π([m]) = [m] for no m ∈ [n], m < n, and it is connected if for no interval I ⊂ [n], 2 ≤ |I| ≤ n − 1, the image π(I) is an interval. WeExpand
Hopf Algebras, Renormalization and Noncommutative Geometry
Abstract:We explore the relation between the Hopf algebra associated to the renormalization of QFT and the Hopf algebra associated to the NCG computations of tranverse index theory for foliations.
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1994
TLDR
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used. Expand