PROPped up graph cohomology
量子代数
2007-05-23 v3 代数拓扑
摘要
We consider graph complexes with a flow and compute their cohomology. More specifically, we prove that for a PROP generated by a Koszul dioperad, the corresponding graph complex gives a minimal model of the PROP. We also give another proof of the existence of a minimal model of the bialgebra PROP from math.AT/0209007. These results are based on the useful notion of a 1/2 PROP introduced by Kontsevich in an e-mail message to the first author.
引用
@article{arxiv.math/0307081,
title = {PROPped up graph cohomology},
author = {Martin Markl and Alexander A. Voronov},
journal= {arXiv preprint arXiv:math/0307081},
year = {2007}
}
备注
33 pages; this is a final version to appear in Maninfest; some corrections made, including adding a condition of connectedness of the differential