Related papers: Algebraic Interplay between Renormalization and Mo…
For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
We define in this paper several Hopf algebras describing the combinatorics of the so-called multi-scale renormalization in quantum field theory. After a brief recall of the main mathematical features of multi-scale renormalization, we…
We describe the combinatorics that arise in summing a double recursion formula for the enumeration of connected Feynman graphs in quantum field theory. In one index the problem is more tractable and yields concise formulas which are…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…
We derive the simplest commutation relations of operator algebras associated to M2 branes and an M5 brane in the $\Omega$-deformed M-theory, which is a natural set-up for Twisted holography. Feynman diagram 1-loop computations in the…
We initiate the study of cluster algebras in Feynman integrals in dimensional regularization. We provide evidence that four-point Feynman integrals with one off-shell leg are described by a $C_{2}$ cluster algebra, and we find cluster…
Functors from (co)operads to bialgebras relate Hopf algebras that occur in renormalisation to operads, which simplifies the proof of the Hopf algebra axioms, and induces a characterisation of the corresponding group of characters and Lie…
For any given algebra of local observables in Minkowski space an associated scaling algebra is constructed on which renormalization group (scaling) transformations act in a canonical manner. The method can be carried over to arbitrary…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
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…
Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…
The independence polynomial of a hypergraph is the generating function for its independent (vertex) sets with respect to their cardinality. This article aims to discuss several recurrence relations for the independence polynomial using some…
We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both…
We study the structure of renormalization Hopf algebras of gauge theories. We identify certain Hopf subalgebras in them, whose character groups are semidirect products of invertible formal power series with formal diffeomorphisms. This can…
Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…
A survey is given on mathematical structures which emerge in multi-loop Feynman diagrams. These are multiply nested sums, and, associated to them by an inverse Mellin transform, specific iterated integrals. Both classes lead to sets of…
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…