Related papers: Note on the Labelled tree graphs
A prime labeling on a graph of order $m$ is an assignment of $\{ 1, 2, \ldots, m \}$ to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The ladder of order $2n$ is the $2 \times n$ grid graph graph…
We extend the covariant color-kinematics duality introduced by Cheung and Mangan to effective field theories. We focus in particular on relations between the effective field theories of gluons only and of gluons coupled to bi-adjoint…
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…
We develop a Feynman rule for energy-level diagrams emphasizing their connections to the double-sided Feynman diagrams and physical processes in the Liouville space. Thereby we completely identify such diagrams and processes contributing to…
In order to generalize the integration rules to general CHY integrands which include higher order poles, algorithms are proposed in two directions. One is to conjecture new rules, and the other is to use the cross-ratio identity method. In…
We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble…
A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
The algebraic approach to the construction of the reflexive polyhedra that yield Calabi-Yau spaces in three or more complex dimensions with K3 fibres reveals graphs that include and generalize the Dynkin diagrams associated with gauge…
A unified treatment of Schwinger parametrised Feynman amplitudes is suggested which addresses vertices of arbitrary order on the same footing as propagators. Contributions from distinct diagrams are organised collectively. The scheme is…
We make a complete pole analysis of the reflection factors of the boundary scaling Lee-Yang model. In the process we uncover a number of previously unremarked mechanisms for the generation of simple poles in boundary reflection factors,…
A well-known connection between n strings winding around a circle and permutations of n objects plays a fundamental role in the string theory of large N two dimensional Yang Mills theory and elsewhere in topological and physical string…
A new way of computing scattering amplitudes in a certain very important QFT (N=4 SYM) has recently been developed, in which an algebraic structure called the positive Grassmannian plays a very important role. The mathematics of the…
Tangle structure trees, introduced in [3], offer a unified data structure that displays all the tangles of a graph or data set together with certificates for the non-existence of any other tangles, either locally or overall. In this paper…
The Loop-Tree Duality (LTD) is a novel perturbative method in QFT that establishes a relation between loop-level and tree-level scattering amplitudes. This is achieved by directly applying the Residue Theorem to the loop-energy-integration.…
We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…
We show the equivalence between one-way reflections and relative projective representations. We construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We give two applications of the…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…