Related papers: Feynman motives and deletion-contraction relations
The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…
Unveiling hidden symmetries within Feynman diagrams is crucial for achieving more efficient computations in high-energy physics. In this paper, we study the symmetries underlying the causal Loop-Tree Duality (LTD) representations through a…
We show that the category of motivic spaces with transfers along finite flat morphisms, over a perfect field, satisfies all the properties we have come to expect of good categories of motives. In particular we establish the analog of…
We express connected Fermionic Green's functions in terms of completely explicit tree formulas. In contrast with the ordinary formulation in terms of Feynman graphs these formulas allow a completely transparent proof of convergence of the…
We construct symmetric monoidal categories $\LRF, \FD$ of rooted forests and Feynman graphs. These categories closely resemble finitary abelian categories, and in particular, the notion of Ringel-Hall algebra applies. The Ringel-Hall Hopf…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over…
In this note we describe very explicitly a rich family of mixed motives that generates Voevodsky's $DM^{eff}_{gm}{\mathbb{Q}}$ (as a triangulated category). They "should be" mixed since they have only one non-zero Betti cohomology group.…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool…
We study for subgroups $G\subseteq U(N)$ partial summations of the $\theta$-expanded perturbation theory. On diagrammatic level a summation procedure is established, which in the U(N) case delivers the full star-product induced rules.…
The contributions of this paper are twofold. Within the framework of Grothendieck's fibrational category theory, we present a web of fundamental 2-adjunctions surrounding the formation of the category of all small diagrams in a given…
Let X be a smooth scheme, Z a smooth closed subscheme, and U the open complement. Given any localizing and A1-homotopy invariant of dg categories E, we construct an associated Gysin triangle relating the value of E at the dg categories of…
We introduce a method to find network motifs in knowledge graphs. Network motifs are useful patterns or meaningful subunits of the graph that recur frequently. We extend the common definition of a network motif to coincide with a basic…
We consider two seemingly unrelated problems, the calculation of the WKB expansion of the harmonic oscillator wave functions and the counting the number of Feynman diagrams in QED or in many-body physics and show that their solutions are…
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…
A representation of the perturbation series of a general functional measure is given in terms of generalized Feynman graphs and -rules. The graphical calculus is applied to certain functional measures of L\'evy type. A graphical notion of…
We give necessary conditions for a category fibred in pseudo-abelian additive categories over the classifying topos of a profinite group to be a stack; these conditions are sufficient when the coefficients are $\mathbf{Q}$-linear. This…
Two programs for the computation of perturbative expansions of quantum field theory amplitudes are provided. feyngen can be used to generate Feynman graphs for Yang-Mills, QED and $\varphi^k$ theories. Using dedicated graph theoretic tools…
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…