Related papers: On the bridgeless graph complex
An analog of Kreimer's coproduct from renormalization of Feynman integrals in quantum field theory, endows an analog of Kontsevich's graph complex with a dg-coalgebra structure. The graph complex is generated by orientation classes of…
The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antiprismatic graphs, which are the complement of prismatic…
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…
We compute the Kontsevich graph cohomology in loop order 11, and for some degrees in higher loop order. We apply our results to discuss a conjecture of F. Brown, providing a counterexample to a strong version of the conjecture.
We study Bott-Chern cohomology on compact complex non-K\"ahler surfaces. In particular, we compute such a cohomology for compact complex surfaces in class $\text{VII}$ and for compact complex surfaces diffeomorphic to solvmanifolds.
We introduce the notion of skew-holomorphic Lie algebroid on a complex manifold, and explore some cohomologies theories that one can associate to it. Examples are given in terms of holomorphic Poisson structures of various sorts.
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
We study the Bott-Chern cohomology of complex orbifolds obtained as quotient of a compact complex manifold by a finite group of biholomorphisms.
Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…
The dual Kontsevich cycles in the double dual of associative graph homology correspond to polynomials in the Miller-Morita-Mumford classes in the integral cohomology of mapping class groups. I explain how the coefficients of these…
In this note, we survey our recent work concerning cohomologies of harmonic bundles on quasi-compact Kaehler manifolds.
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
A linear constraint is given on the Betti numbers of a compact hyper-Kaehler manifold, using an index formula for c_1c_{n-1} on an almost complex manifold. The topology of some other manifolds with reduced holonomy is also discussed…
Poisson brackets admit infinitesimal symmetries which are encoded using oriented graphs; this construction is due to Kontsevich (1996). We formulate several open problems about combinatorial and topological properties of the graphs…
We review the gauge and ghost cyle graph complexes as defined by Kreimer, Sars and van Suijlekom in "Quantization of gauge fields, graph polynomials and graph homology" and compute their cohomology. These complexes are generated by…
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.
A standard combinatorial construction, due to Kontsevich, associates to any A-infinity algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
Connectivity is a central notion of graph theory and plays an important role in graph algorithm design and applications. With emerging new applications in networks, a new type of graph connectivity problem has been getting more…