Related papers: Feynman motives and deletion-contraction relations
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
With representation-theoretic applications in mind, we construct a formalism of reduced motives with integral coefficients. These are motivic sheaves from which the higher motivic cohomology of the base scheme has been removed. We show that…
Making use of the recent theory of noncommutative motives, we construct a new motivic measure, which we call the Tits' motivic measure. As a first application, we prove that two Severi-Brauer varieties (or more generally twisted…
Given a perfect field of exponential characteristic $e$ and a functor $f:\mathcal A\to\mathcal B$ between symmetric monoidal strict $V$-categories of correspondences satisfying the cancellation property such that the induced morphisms of…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
We study the $a$-sequence $(a_0(G), a_1(G), \cdots)$ of a finite simple graph $G$, defined recursively through a combinatorial rule and known to coincide with the sequence of rational Betti numbers of the real toric variety associated with…
We propose a method for obtaining parsimonious decompositions of networks into higher order interactions which can take the form of arbitrary motifs.The method is based on a class of analytically solvable generative models, where vertices…
Kontsevich's formula for a deformation quantization of Poisson structures involves a Feynman series of graphs, with the weights given by some complicated integrals (using certain pullbacks of the standard angle form on a circe). We explain…
The Rooted Maps Theory, a branch of the Theory of Homology, is shown to be a powerful tool for investigating the topological properties of Feynman diagrams, related to the single particle propagator in the quantum many-body systems. The…
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…
Understanding feature-outcome associations in high-dimensional data remains challenging when relationships vary across subpopulations, yet standard methods assuming global associations miss context-dependent patterns, reducing statistical…
This paper looks at the task of network topology inference, where the goal is to learn an unknown graph from nodal observations. One of the novelties of the approach put forth is the consideration of prior information about the density of…
This paper studies Artin-Tate motives over number rings. As a subcategory of geometric motives, the triangulated category of Artin-Tate motives DATM(S) is generated by motives of schemes that are finite over the base S. After establishing…
A functional method to achieve the summation of all Feynman graphs relevant to a particular Field Theory process is suggested, and applied to QED, demonstrating manifestly gauge invariant calculations of the dressed photon propagator in…
We derive a minimal set of Feynman rules for the loop amplitudes in unitary models of closed strings, whose target space is a simply laced (extended) Dynkin diagram. The string field Feynman graphs are composed of propagators, vertices…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
We show that the Poincare polynomial associated with the orbifold cell decomposition of the moduli space of smooth algebraic curves with distinct marked points satisfies a topological recursion formula of the Eynard-Orantin type. The…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…