Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Hairy graphs to ribbon graphs via a fixed source graph complex (1912.09438v2)

Published 19 Dec 2019 in math.QA

Abstract: We show that the hairy graph complex $(HGC_{n,n},d)$ appears as an associated graded complex of the oriented graph complex $(OGC_{n+1},d)$, subject to the filtration on the number of targets, or equivalently sources, called the fixed source graph complex. The fixed source graph complex $(OGC_1,d_0)$ maps into the ribbon graph complex $RGC$, which models the moduli space of Riemann surfaces with marked points. The full differential $d$ on the oriented graph complex $OGC_{n+1}$ corresponds to the deformed differential $d+h$ on the hairy graph complex $HGC_{n,n}$, where $h$ adds a hair. This deformed complex $(HGC_{n,n},d+h)$ is already known to be quasi-isomorphic to standard Kontsevich's graph complex $GC2_n$. This gives a new connection between the standard and the oriented version of Kontsevich's graph complex.

Summary

We haven't generated a summary for this paper yet.