The number of small covers over cubes
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Choi, Suyoung | ko |
| dc.date.accessioned | 2017-12-05T02:09:42Z | - |
| dc.date.available | 2017-12-05T02:09:42Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2008 | - |
| dc.identifier.citation | ALGEBRAIC AND GEOMETRIC TOPOLOGY, v.8, no.4, pp.2391 - 2399 | - |
| dc.identifier.issn | 1472-2739 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/227524 | - |
| dc.description.abstract | In the present paper we find a bijection between the set of small covers over an n-cube and the set of acyclic digraphs with n labeled nodes. Using this, we give formulas of the number of small covers over an n-cube (generally, a product of simplices) up to Davis-Januszkiewicz equivalence classes and Z(2)(n)-equivariant homeomorphism classes. Moreover we prove that the number of acyclic digraphs with n unlabeled nodes is an upper bound of the number of small covers over an n-cube up to homeomorphism. | - |
| dc.language | English | - |
| dc.publisher | GEOMETRY TOPOLOGY PUBLICATIONS | - |
| dc.title | The number of small covers over cubes | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000272699700019 | - |
| dc.identifier.scopusid | 2-s2.0-72949112493 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 8 | - |
| dc.citation.issue | 4 | - |
| dc.citation.beginningpage | 2391 | - |
| dc.citation.endingpage | 2399 | - |
| dc.citation.publicationname | ALGEBRAIC AND GEOMETRIC TOPOLOGY | - |
| dc.identifier.doi | 10.2140/agt.2008.8.2391 | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 21 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.