The number of small covers over cubes
Geometric Topology
2014-10-01 v2 Combinatorics
Abstract
In the present paper we find a bijection between the set of small covers over an -cube and the set of acyclic digraphs with labeled nodes. Using this, we give a formula of the number of small covers over an -cube (generally, a product of simplices) up to Davis-Januszkiewicz equivalence classes and -equivariant diffeomorphism classes. Moreover we prove that the number of acyclic digraphs with unlabeled nodes is an upper bound of the number of small covers over an -cube up to diffeomorphism.
Cite
@article{arxiv.0802.1982,
title = {The number of small covers over cubes},
author = {Suyoung Choi},
journal= {arXiv preprint arXiv:0802.1982},
year = {2014}
}
Comments
8 pages