Related papers: Algebraic Interplay between Renormalization and Mo…
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…
We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.
This paper studies the problem of counting homomorphisms from a bipartite source graph to a bipartite target graph. An exact formula is first derived for the number of homomorphisms from a complete bipartite graph into a general bipartite…
We show a direct matching between individual Feynman diagrams and integration measures in the scattering equation formalism of Cachazo, He and Yuan. The connection is most easily explained in terms of triangular graphs associated with…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
We consider the perturbative renormalization of the Schwinger-Dyson functional, which is the generating functional of the expectation values of the products of the composite operator given by the field derivative of the action. It is argued…
In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimization problems. A goal here is to establish bridges between…
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…
We study binomiality of the steady state ideals of chemical reaction networks. Considering rate constants as indeterminates, the concept of unconditional binomiality has been introduced and an algorithm based on linear algebra has been…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
By identifying each standard flag with a trivalent Feynman diagram, the corresponding propagators can be read directly from the flag itself. Within the flag representation, the kinematic Jacobi identity (equivalently, the residue theorem on…
We revisit the issue of mixing matrix renormalization in theories that include Dirac or Majorana fermions. We show how a gauge-variant on-shell renormalized mixing matrix can be related to a manifestly gauge-independent one within a…
This paper gives a review of Connes-Kreimer formulation of perturbative renormalization in Quantum Field Theory. We begin with the derivation of the Feynman calculus, the Hopf algebra structure on Feynman diagrams and we show the natural…
In this work, we provide a method to obtain the renormalised measure in quantum field theory directly from the renormalisation of the expansion of the original measure. Our approach is based on BPHZ renormalisation via multi-indices, a…
We introduce the regularized integrals for decorated graphs on elliptic curves, which produces an almost holomorphic function on upper half plane. Then we give the graph version of holomorphic anomaly equation to study the anti-holomorphic…
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…
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…
Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…
We construct a group acting on a binary rooted tree; this discrete group mimics the monodromy action of iterates of $f(z)=z^2-1$ on associated coverings of the Riemann sphere. We then derive some algebraic properties of the group, and…