Related papers: Feynman motives and deletion-contraction relations
A T-dualized selfdual inspired formulation of massive vector fields coupled to arbitrary matter is generated; subsequently its perturbative series modeling a spontaneously broken gauge theory is analyzed. The new Feynman rules and external…
We prove by explicit calculation that Feynman graphs in noncommutative Yang-Mills theory made of repeated insertions into itself of arbitrarily many one-loop ghost propagator corrections are renormalizable by local counterterms. This…
A mixed Weil cohomology with values in an abelian rigid tensor category is a cohomological functor on Voevodsky's category of motives which is satisfying K\"unneth formula and such that its restriction to Chow motives is a Weil cohomology.…
The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…
We give an explicit formula for the motivic integrals related to the Milnor number over spaces of parametrised arcs on the plane with fixed tangency orders with the axis. These integrals are rational functions of the parameters and the…
Using the formalism of Cox rings and universal torsors, we prove a decomposition of the Grothendieck motive of the moduli space of morphisms from an arbitrary smooth projective curve to a Mori Dream Space (MDS). For the simplest cases of…
The purpose of this paper is to study motivic aspects of the Hitchin system for $\mathrm{GL}_n$. Our results include the following. (a) We prove the motivic decomposition conjecture of Corti-Hanamura for the Hitchin system; in particular,…
This thesis provides an extension of the work of Dirk Kreimer and Alain Connes on the Hopf algebra structure of Feynman graphs and renormalization to general graphs. Additionally, an algebraic structure of the asymptotics of formal power…
The integrand of any multi-loop integral is characterised after Feynman parametrisation by two polynomials. In this review we summarise the properties of these polynomials. Topics covered in this article include among others: Spanning trees…
Chord diagrams and combinatorics of word algebras are used to model products of Dirac matrices, their traces, and contractions. A simple formula for the result of arbitrary contractions is derived, simplifying and extending an old…
We study the related questions: (i) when Feynman amplitudes in massless $\phi^4$ theory evaluate to multiple zeta values, and (ii) when their underlying motives are mixed Tate. More generally, by considering configurations of singular…
Diagrammatic approaches to perturbation theory transformed the practicability of calculations in particle physics. In the case of extended theories of gravity, however, obtaining the relevant diagrammatic rules is non-trivial: we must…
We show that the motivic vanishing cycles introduced by J. Denef and F. Loeser give rise to a motivic measure on the Grothendieck ring of varieties over the affine line. We discuss the relation of this motivic measure to the motivic measure…
This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…
Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we store an ordering…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
This paper investigates the structure of generic motives and their implications for the motivic cohomology of fields. Originating in Voevodsky's theory of motives and related to Beilinson's vision of a motivic $t$-structure, generic motives…
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
A computer program has been developed which generates Feynman graphs automatically for scattering and decay processes in non-Abelian gauge theory of high-energy physics. A new acceleration method is presented for both generating and…
Let $k$ be a field of characteristic zero with a fixed embedding $\sigma:k\hookrightarrow \mathbb{C}$ into the field of complex numbers. Given a $k$-variety $X$, we use the triangulated category of \'etale motives with rational coefficients…