Related papers: Feynman motives and deletion-contraction relations

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the…

In this corrigendum to arXiv:2305.02973, we justify that the motivation behind Conjecture 5.1 is based on a mistaken notion. Moreover, we prove a stronger theorem that disproves the conjecture, and obtain an optimal gradient vector field on…

Higher-order diagrams required for radiative corrections to mixed electroweak and QCD processes at the LHC and anticipated future colliders will require numerically stable representations of the associated Feynman diagrams. The…

We introduce and study a strong "thin triangle"' condition for directed graphs, which generalises the usual notion of hyperbolicity for a metric space. We prove that finitely generated left cancellative monoids whose right Cayley graphs…

We describe the combinatorics that arise in summing a double recursion formula for the enumeration of connected Feynman graphs in quantum field theory. In one index the problem is more tractable and yields concise formulas which are…

We construct derived fundamental group schemes for Tate motives over connected smooth schemes over fields. We show that there exists a pro affine derived group scheme over the rationals such that its category of perfect representations…

This Note gives conditions that must be imposed to algebraic multilevel discretizations involving at the same time nodal and edge elements so that a gradient-prolongation commutativity condition will be satisfied; this condition is very…

Ever since the introduction of motivic homotopy theory, as a well-proposed approximation of Grothendieck's dream, algebraic geometers then have the chance to study schemes via a homotopy theory. However topologists also found that lifting…

Theory of motivic superpolynomials is developed, including its extension to algebraic links colored by rows, relations to $L$-functions of plane curve singularities, the justification of the motivic versions of Weak Riemann Hypothesis, and…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…

In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…

The purpose of this paper is to give a twisted version of the Eynard-Orantin topological recursion by a 2D Topological Quantum Field Theory. We define a kernel for a 2D TQFT and use an algebraic definition for a topological recursion to…

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

We look at geometrical and arithmetical patterns created from a finite subset of Z^n by diffracting waves and bipartite graphs. We hope that this can make a link between Motives and the Melting Crystals/Dimer models in String Theory.

Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

We combine several mini miracles to achieve an elementary understanding of infinite loop spaces and very effective spectra in the algebro-geometric setting of motivic homotopy theory. Our approach combines $\Gamma$-spaces and framed…