Pith. sign in

On interrelations between graph complexes

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

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 cohomology groups. A new result relating the cohomology of the sourced-targeted graph complex in dimension $d+1$ with the direct sum of two copies of the cohomology group of Maxim Kontsevich's graph complex $GC_d$ in dimension $d$ is obtained. We introduce a new graph complex spanned by purely trivalent graphs and show that its cohomology is isomorphic to $H(GC_d)$.

fields

math.QA 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

The oriented graph complex revisited

math.QA · 2024-11-29 · conditional · novelty 7.0

For any integer d, the Kontsevich graph complex GC^2_d and the oriented graph complex OGC^2_{d+1} are connected by a zigzag of quasi-isomorphisms of dg Lie algebras.

citing papers explorer

Showing 1 of 1 citing paper.

  • The oriented graph complex revisited math.QA · 2024-11-29 · conditional · none · ref 7 · internal anchor

    For any integer d, the Kontsevich graph complex GC^2_d and the oriented graph complex OGC^2_{d+1} are connected by a zigzag of quasi-isomorphisms of dg Lie algebras.