Pith. sign in

REVIEW 1 cited by

On interrelations between graph complexes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.06669 v3 pith:4ERGN3D3 submitted 2023-11-11 math.QA

classification math.QA
keywords graphcohomologycomplexdimensionkontsevichmaximcomplexescopies
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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)$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The oriented graph complex revisited

    math.QA 2024-11 conditional novelty 7.0 of 10

    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.

Pith tools