Related papers: Feynman motives and deletion-contraction relations
We investigate combinatorial and algebraic aspects of the interplay between renormalization and monodromies for Feynman amplitudes. We clarify how extraction of subgraphs from a Feynman graph interacts with putting edges onshell or with…
A noncommutative Feynman graph is a ribbon graph and can be drawn on a genus $g$ 2-surface with a boundary. We formulate a general convergence theorem for the noncommutative Feynman graphs in topological terms and prove it for some classes…
We construct a period regulator for motivic cohomology of an algebraic scheme over a subfield of the complex numbers. For the field of algebraic numbers we formulate a period conjecture for motivic cohomology by saying that this period…
Averbouch, Godlin and Makowsky define the edge elimination polynomial of a graph by a recurrence relation with respect to the deletion, contraction and extraction of an edge. It generalizes some well-known graph polynomials such as the…
A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…
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…
We define a graph Laplacian with vertex weights in addition to the more classical edge weights, which unifies the combinatorial Laplacian and the normalised Laplacian. Moreover, we give a combinatorial interpretation for the coefficients of…
We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and deletion of edges together with their end points. Like in the case of deletion and contraction only (W.…
We apply Wildeshaus's theory of motivic intermediate extensions to the motivic decomposition conjecture, formulated by Deninger-Murre and Corti-Hanamura. We first obtain a general motivic decomposition for the Chow motive of an arbitrary…
We study the geometry and Hodge theory of the cubic hypersurfaces attached to two-loop Feynman integrals for generic physical parameters. We show that the Hodge structure attached to planar two-loop Feynman graphs decomposes into mixed Tate…
This article gives a short step-by-step introduction to the representation of parametric Feynman integrals in scalar perturbative quantum field theory as periods of motives. The application of motivic Galois theory to the algebro-geometric…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
Already in the 1960s Grothendieck understood that one could obtain an almost entirely satisfactory theory of motives over a finite field when one assumes the full Tate conjecture. In this note we prove a similar result for motivic…
The subring of the Grothendieck ring of varieties generated by the graph hypersurfaces of quantum field theory maps to the monoid ring of stable birational equivalence classes of varieties. We show that the image of this map is the copy of…
Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture. In this work, we define four types of generalised Kontsevich…
We define a theory of etale motives over a noetherian scheme. This provides a system of categories of complexes of motivic sheaves with integral coefficients which is closed under the six operations of Grothendieck. The rational part of…
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
In this paper we study metric ribbon graphs, in particular, directed metric ribbon graphs. These ribbon graphs are dual to bipartite maps and appear in the context of Abelian differentials. We prove that it is possible to decompose a…