Related papers: The 11-loop graph cohomology
We explain how the usual algebras of Feynman diagrams behave under the grope degree introduced in "Grope cobordism of classical knots." We show that the Kontsevich integral rationally classifies grope cobordisms of knots in 3-space when the…
We introduce an algebra bundle of chord diagrams over the configuration space of N points in the complex plane on which we put the Knizhnik-Zamolodchikov connection. For that particular connection, the holonomy along a loop in the base is…
Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental…
We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…
Motivated by the loop space cohomology we construct the secondary operations on the cohomology $H^*(X; \mathbb{Z}_p)$ to be a Hopf algebra for a simply connected space $X.$ The loop space cohomology ring $H^*(\Omega X; \mathbb{Z}_p)$ is…
Arone and Turchin defined graph-complexes computing the rational homotopy of the spaces of long embeddings. The graph-complexes split into a direct sum by the number of loops in graphs. In this paper we compute the homology of its two-loop…
We give a detailed explicit computation of weights of Kontsevich graphs which arise from connection and curvature terms within the globalization picture for the special case of symplectic manifolds. We will show how the weights for the…
We define algebraic structures on graph cohomology and prove that they correspond to algebraic structures on the cohomology of the spaces of imbeddings of S^1 or R into R^n. As a corollary, we deduce the existence of an infinite number of…
We give a Hopf-algebraic formulation of the $R^*$-operation, which is a canonical way to render UV and IR divergent Euclidean Feynman diagrams finite. Our analysis uncovers a close connection to Brown's Hopf algebra of motic graphs. Using…
A Feynman period is a particular residue of a scalar Feynman integral which is both physically and number theoretically interesting. Two ways in which the graph theory of the underlying Feynman graph can illuminate the Feynman period are…
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
The space of smotth functions and vector fields on $\R^d$ is a Lie subalgebra of the (graded) Lie algebra $T\_{poly}(\R^d)$, equipped with the Scouten bracket. In this paper, we compute the cohomology of this subalgebra for the adjoint…
In this paper, we shall give an explicit Gauss diagram formula for the Kontsevich integral of links up to degree four. This practical formula enables us to actually compute the Kontsevich integral in a combinatorial way.
The space $T_{poly}(\mathbb R^d)$ of all tensor fields on $\mathbb R^d$, equipped with the Schouten bracket is a Lie algebra. The subspace of ascending tensors is a Lie subalgebra of $T_{poly}(\mathbb R^d)$. In this paper, we compute the…
We give a conceptual formulation of Kontsevich's `dual construction' producing graph cohomology classes from a differential graded Frobenius algebra with an odd scalar product. Our construction -- whilst equivalent to the original one -- is…
The real vector space of non-oriented graphs is known to carry a differential graded Lie algebra structure. Cocycles in the Kontsevich graph complex, expressed using formal sums of graphs on $n$ vertices and $2n-2$ edges, induce -- under…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
Inspired by Feynman integral computations in quantum field theory, Kontsevich conjectured in 1997 that the number of points of graph hypersurfaces over a finite field $\F_q$ is a (quasi-) polynomial in $q$. Stembridge verified this for all…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…