Related papers: Note on the Labelled tree graphs
One-loop integrands in Cachazo-He-Yuan (CHY) formula, which is based on the forward limit of tree-level amplitudes, involves linear propagators that are different from quadratic ones in traditional Feynman diagrams. In this paper, we…
We describe the unitarity approach for the numerical computation of two-loop integral coefficients of scattering amplitudes. It is well known that the leading propagator singularities of an amplitude's integrand are related to products of…
For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge…
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…
An increasing 1,2-tree is a labeled graph formed by starting with a vertex and then repeatedly attaching a leaf to a vertex or a triangle to an edge, the labeling of the vertices corresponding to the order in which the vertices are added.…
We consider the quiver Yangians associated to general affine Dynkin diagrams. Although the quivers are generically not toric, the algebras have some similar structures. The odd reflections of the affine Dynkin diagrams should correspond to…
Recently, we proposed a new approach using a punctured Elliptic curve in the CHY framework in order to compute one-loop scattering amplitudes. In this note, we further develop this approach by introducing a set of connectors, which become…
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…
A T-dualized selfdual inspired formulation of massive vector fields coupled to arbitrary matter is generated; subsequently its perturbative series modeling a spontaneously broken gauge theory is analyzed. The new Feynman rules and external…
A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of…
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…
All tree-level amplitudes in Einstein-Yang-Mills (EYM) theory and gravity (GR) can be expanded in terms of color ordered Yang-Mills (YM) ones whose coefficients are polynomial functions of Lorentz inner products and are constructed by a…
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 graph interacts with putting edges onshell or with…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
We study the class of planar Feynman integrals that can be constructed by sequentially intersecting traintrack diagrams without forming a closed traintrack loop. After describing how to derive a $2L$-fold integral representation of any…
We present a diagrammatic decomposition of the transition pair correlation function for the uniform electron gas. We demonstrate explicitly that ring and ladder diagrams are dual counterparts that capture significant long- and short-ranged…
Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a…
Tree alignment graphs (TAGs) provide an intuitive data structure for storing phylogenetic trees that exhibits the relationships of the individual input trees and can potentially account for nested taxonomic relationships. This paper…
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…