Related papers: The 11-loop graph cohomology

In this paper we present a concrete counterexample to the conjecture of Kontsevich about the polynomial countability of graph hypersurfaces. In contrast to this, we show that the "wheel with spokes" graphs $WS_n$ are polynomially countable.

It is well known how the linking number and framing can be extracted from the degree 1 part of the (framed) Kontsevich integral. This note gives a general formula expressing any product of powers of these two invariants as combination of…

We compute the group cohomology of $32\Gamma_3f$, a certain group of order 32. For this we construct explicit cocycle representatives of the cohomology generators. We thus lay to rest a discrepancy between several published computations of…

We discuss the computational complexity of the perturbative evaluation of scattering amplitudes, both by the Caravaglios-Moretti algorithm and by direct evaluation of the individual diagrams. For a self-interacting scalar theory, we…

We study Maxim Kontsevich's graph complex $GC_d$ for any integer $d$ as well as its oriented and targeted versions, and show new short proofs of the theorems due to Thomas Willwacher and Marko Zivkovic which establish isomorphisms of their…

The singular chain complex of the iterated loop space is expressed in terms of the cobar construction. After that we consider the spectral sequence of the cobar construction and calculate its first term over Z/p-coefficients and over a…

We construct maps on hat Heegaard Floer homology for cobordisms decorated with graphs. The graph TQFT allows for cobordisms with disconnected ends. Our construction uses Juh\'{a}sz's sutured Floer TQFT. We compute the maps for several…

We present some new results on the cohomology of a large scope of SL\_2-groups in degrees above the virtual cohomological dimension; yielding some partial positive results for the Quillen conjecture in rank one. We combine these results…

We construct a diagrammatic coaction acting on one-loop Feynman graphs and their cuts. The graphs are naturally identified with the corresponding (cut) Feynman integrals in dimensional regularization, whose coefficients of the Laurent…

In this paper, we first remind how we can see the "hull" of the pinwheel tiling as an inverse limit of simplicial complexes (Anderson and Putnam) and we then adapt the PV cohomology introduced in a paper of Bellissard and Savinien to define…

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

In this series of papers, we established that $Q^{\gamma_3}_{d=4}(P)$ is a coboundary in 4D (paper II arXiv:2409.12555), and we presented a series of experimental results about the (non)trivialisation of Kontsevich graph flows of…

Computations in the cohomology of finite groups.

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…

Salikhov has proved a conjecture of Kontsevich and Shoikhet by reducing it to the consideration of three families of graphs, a consideration which was left to the reader for two of those families. We show, that the conjecture is just a very…

Problem of finding an optimal upper bound for the chromatic no. of a graph is still open and very hard. Borodin and Kostochka Conjecture is still open and if proved will improve Brook bound on Chromatic no. of a graph. Here we prove Borodin…

Motivated by the problem of deformation quantization we introduce and study directed graph complexes with oriented loops and wheels. We develop some technique for computing cohomology of such graph complexes and apply it to several concrete…

We obtain a mixed complex, simpler that the canonical one, given the Hochschild, cyclic, negative and periodic homology of a crossed product E=A#fH, where H is an arbitrary Hopf algebra and f is a convolution invertible cocycle with values…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

If $R$ is a commutative ring, $M$ a compact $R$-oriented manifold and $G$ a finite graph without loops or multiple edges, we consider the graph configuration space $M^G$ and a Bendersky-Gitler type spectral sequence converging to the…