Header

UZH-Logo

Maintenance Infos

Multiple edges in M. Kontsevich's graph complexes and computations of the dimensions and Euler characteristics


Willwacher, Thomas; Živković, Marko (2015). Multiple edges in M. Kontsevich's graph complexes and computations of the dimensions and Euler characteristics. Advances in Mathematics, 272:553-578.

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.

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.

Statistics

Citations

1 citation in Web of Science®
1 citation in Scopus®
Google Scholar™

Altmetrics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Date:6 February 2015
Deposited On:28 Jan 2016 07:39
Last Modified:08 Dec 2017 16:45
Publisher:Elsevier
ISSN:0001-8708
Free access at:Publisher DOI. An embargo period may apply.
Publisher DOI:https://doi.org/10.1016/j.aim.2014.12.010

Download

Full text not available from this repository.
View at publisher