Related papers: Brunnian links and Kontsevich graph complex I

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

In the formulation of his celebrated Formality conjecture, M. Kontsevich introduced a universal version of the deformation theory for the Schouten algebra of polyvector fields on affine manifolds. This universal deformation complex takes…

We study families of diffeomorphisms detected by trivalent graphs via the Kontsevich classes. We specify some recent results and constructions of the second named author to show that those non-trivial elements in homotopy groups…

In this addendum, we give a differential form interpretation of the proof of the main theorem of arXiv:1812.02448, which gives lower bounds of the dimensions of $\pi_k(B\mathrm{Diff}(D^4,\partial))\otimes\mathbb{Q}$ in terms of the…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

In 1999, Rozansky conjectured the existence of a rational presentation of the Kontsevich integral of a knot. Roughly speaking, this rational presentation of the Kontsevich integral would sum formal power series into rational functions with…

We create a framework for odd Khovanov homology in the spirit of Bar-Natan's construction for the ordinary Khovanov homology. Namely, we express the cube of resolutions of a link diagram as a diagram in a certain 2-category of chronological…

For the Kirillov-Poisson structure on the vector space $\g^*$, where $\g$ is a finite-dimensional Lie algebra, it is known at least two canonical deformations quantization of this structure: they are the M. Kontsevich universal formula [K],…

Let $P$ be a Poisson structure on a finite-dimensional affine real manifold. Can $P$ be deformed in such a way that it stays Poisson? The language of Kontsevich graphs provides a universal approach -- with respect to all affine Poisson…

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…

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 study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes…

We prove that, for large $n$, every $3$-connected $D$-regular graph on $n$ vertices with $D \geq n/4$ is Hamiltonian. This is best possible and confirms a conjecture posed independently by Bollob\'as and H\"aggkvist in the 1970s. The proof…

We introduce a "minimal" Kontsevich integral that generates the original Kontsevich integral while at the same time producing ribbons whose boundaries are the braids on which the minimal Kontsevich integral is evaluated. We generalize the…

We compare the cohomology complex defined by Baranovsky and Sazdanovi\'{c}, that is the $E_{1}$ page of a spectral sequence converging to the homology of the configuration space depending on a graph, with the rational model for the…

We develop a linear theory of discrete complex analysis on general quad-graphs, continuing and extending previous work of Duffin, Mercat, Kenyon, Chelkak and Smirnov on discrete complex analysis on rhombic quad-graphs. Our approach based on…

We define a dg-category of looped diagrams which we use to construct operations on the Hochschild complex of commutative Frobenius dg-algebras. We show that we recover the operations known for symmetric Frobenius dg-algebras constructed…

We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…

We prove that if G is a graph without 3-cycles and 4-cycles, then the discrete cubical homology of G is trivial in dimension d, for all d\ge 2. We also construct a sequence { G_d } of graphs such that this homology is non-trivial in…

Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…