The dimensions and Euler characteristics of M. Kontsevich's graph complexes
classification
🧮 math.QA
math.CO
keywords
complexesgraphdimensionseulerfunctiongeneratinggraphskontsevich
read the original abstract
We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that graphs with multiple edges can be omitted from these graph complexes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.