Related papers: Note on the Labelled tree graphs

We study systems of combinatorial Dyson-Schwinger equations with an arbitrary number $N$ of coupling constants. The considered Hopf algebra of Feynman graphs is $\mathbb{N}^N$-graded, and we wonder if the graded subalgebra generated by the…

Let $G$ be a 3-connected planar graph. Define the co-tree of a spanning tree $T$ of $G$ as the graph induced by the dual edges of $E(G)-E(T)$. The well-known cut-cycle duality implies that the co-tree is itself a tree. Let a $k$-tree be a…

A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…

In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…

A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…

In this expository article we review recent advances in our understanding of the combinatorial and algebraic structure of perturbation theory in terms of Feynman graphs, and Dyson-Schwinger equations. Starting from Lie and Hopf algebras of…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While…

We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are…

A comprehensive study is performed of general massive, scalar, two-loop Feynman diagrams with three external legs. Algorithms for their numerical evaluation are introduced and discussed, numerical results are shown for all different…

Color-ordered tree level scattering amplitudes in Yang-Mills theories can be written as a sum over terms which display the various propagator poles of Feynman diagrams. The numerators in these expressions which are obtained by…

We study the $n$-point functions of scalar multi-trace operators in the $U(N_c)$ gauge theory with adjacent scalars, such as ${\cal N}=4$ super Yang-Mills, at tree-level by using finite group methods. We derive a set of formulae of the…

To a large class of graphs of groups we associate a C*-algebra universal for generators and relations. We show that this C*-algebra is stably isomorphic to the crossed product induced from the action of the fundamental group of the graph of…

We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…

We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…

We discuss the duality theorem, which provides a relation between loop integrals and phase space integrals. We rederive the duality relation for the one-loop case and extend it to two and higher-order loops. We explicitly show its…

Using the {\em cutting and sewing} procedure we show how to get Feynman diagrams, up to two-loop order, of $\Phi^{4}$-theory with an internal SU(N) symmetry group, starting from tachyon amplitudes of the open bosonic string theory. In a…

We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…

We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…

Partition- and moment functions for a general (not necessarily Gaussian) functional measure that is perturbed by a Gibbs factor are calculated using generalized Feynman graphs. From the graphical calculus, a new notion of Wick ordering…