Related papers: Note on the Labelled tree graphs
We introduce and study the notion of a dual Feynman transform of a modular operad. This generalizes and gives a conceptual explanation of Kontsevich's dual construction producing graph cohomology classes from a contractible differential…
We continue our investigation into the insertion-elimination Lie algebra of Feynman graphs in the ladder case, emphasizing the structure of this Lie algebra relevant for future applications in the study of Dyson-Schwinger equations. We work…
We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequently forms a Lie…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
Feynman diagrams are the foremost tool in the perturbative study of quantum field theory. In gauge theories, the full potential of this tool is revealed when it is combined with the Slavanov-Taylor identities associated with the local gauge…
We show that accordiohedra furnish polytopes which encode amplitudes for all massive scalar field theories with generic interactions. This is done by deriving integral formulae for the Feynman diagrams at tree level and integrands at one…
Consider an order $n$ abelian group $G$ and a tree $T$ on $n$ vertices. When is it possible to (bijectively) label $V(T)$ by $G$ so that along all edges $xy$ of $T$, the sums $x+y$ are distinct? This problem can be traced back to the work…
Feynman diagrams are a pictorial way of describing integrals predicting possible outcomes of interactions of subatomic particles in the context of quantum field physics. It is highly desirable to have an intrinsic mathematical…
In this work we have studied the Kleiss-Kuijf relations for the recently introduced Parke-Taylor factors at one-loop in the CHY approach, that reproduce quadratic Feynman propagators. By doing this, we were able to identify the non-planar…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
We present significant evidence that the powerful property of Yangian invariance extends to a new large class of conformally invariant Feynman integrals. Our results apply to planar Feynman diagrams in any spacetime dimension dual to an…
Recently we showed how, in two-dimensional scalar theories, one-loop threshold diagrams can be cut into the product of one or more tree-level diagrams arXiv:2206.09368. Using this method on the ADE series of Toda models, we computed the…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization of directed graphs, consisting of an undirected graph…
We study tree-level biadjoint scalar amplitudes in the language of $D$-modules. We construct left ideals in the Weyl algebra $D$ that allow a holonomic representation of $n$-point amplitudes in terms of the linear partial differential…
Very recently planar collections of Feynman diagrams were proposed by Borges and one of the authors as the natural generalization of Feynman diagrams for the computation of $k=3$ biadjoint amplitudes. Planar collections are one-dimensional…
Graph-based Bern-Carasso-Johansson (BCJ) relation for Berends-Giele currents in bi-adjoint scalar (BS) theory, which is characterized by connected tree graphs, was proposed in an earlier work. In this note, we provide a systematic study of…
Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…
We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…