Related papers: Feynman motives and deletion-contraction relations
We prove a motivic enhancement of the classical Picard--Lefschetz formula. Our proof is completely motivic, and yields a description of the motivic nearby cycles at a quasi-homogeneous singularity, as well as its monodromy, in terms of an…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
We introduce a family of periods of mixed Tate motives called dissection polylogarithms, that are indexed by combinatorial objects called dissection diagrams. The motivic coproduct on the former is encoded by a combinatorial Hopf algebra…
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated…
We consider the category of Deligne 1-motives over a perfect field k of exponential characteristic p and its derived category for a suitable exact structure after inverting p. As a first result, we provide a fully faithful embedding into an…
We show that the Grothendieck-Chow motive of a smooth hyperplane section $Y$ of an inner twisted form $X$ of a Milnor hypersurface splits as a direct sum of shifted copies of the motive of the Severi-Brauer variety of the associated cyclic…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
From the standard procedure for constructing Feynman vacuum graphs in $\phi^4$ theory from the generating functional $Z$, we find a relation with sets of certain combinatorial matrices, which allows us to generate the set of all Feynman…
Using iterated vanishing cycles and convolution, we prove a motivic version of a conjecture of Steenbrink concerning the spectrum of hypersurface singularities
We consider the explanation problem of Graph Neural Networks (GNNs). Most existing GNN explanation methods identify the most important edges or nodes but fail to consider substructures, which are more important for graph data. The only…
In order to use the Gaussian representation for propagators in Feynman amplitudes, a representation which is useful to relate string theory and field theory, one has to prove first that each $\alpha$- parameter (where $\alpha$ is the…
In the formulation of his celebrated Formality conjecture, M. Kontsevich introduced a universal version of the deformation theory for the Schouten algebra of polyvector fields on affine manifolds. This universal deformation complex takes…
Graphs embedded into surfaces have many important applications, in particular, in combinatorics, geometry, and physics. For example, ribbon graphs and their counting is of great interest in string theory and quantum field theory (QFT).…
We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some…
A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le…
We present a method for a recursive graphical construction of Feynman diagrams with their correct multiplicities in quantum electrodynamics. The method is first applied to find all diagrams contributing to the vacuum energy from which all…
The Lie algebra of Feynman graphs gives rise to two natural representations, acting as derivations on the commutative Hopf algebra of Feynman graphs, by creating or eliminating subgraphs. Insertions and eliminations do not commute, but…
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…
This article introduces moduli spaces of coloured graphs on which Feynman amplitudes can be viewed as 'discrete' volume densities. The basic idea behind this construction is that these moduli spaces decompose into disjoint unions of open…
We prove a neat factorization property of Feynman graphs in covariant perturbation theory. The contribution of the graph to the effective action is written as a product of a massless scalar momentum integral that only depends on the basic…