The dimensions and Euler characteristics of M. Kontsevich's graph complexes
Quantum Algebra
2015-02-23 v2 Combinatorics
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.
Cite
@article{arxiv.1401.4974,
title = {The dimensions and Euler characteristics of M. Kontsevich's graph complexes},
author = {Thomas Willwacher and Marko Živković},
journal= {arXiv preprint arXiv:1401.4974},
year = {2015}
}