Partitioning the projective plane and the dunce hat
Combinatorics
2022-07-19 v3
Abstract
We show that any finite triangulation of the real projective plane or the dunce hat is partitionable. To prove this, we introduce simple yet useful gluing tools that allow us to reduce partitionability of a given complex to that of smaller constituent relative subcomplexes such as the disk or the open M\"obius strip. The gluing process generates partitioning schemes with a distinctive shelling/constructible flavor. We also give a tool to lift partitionability of relative simplicial complexes to that of the preimages of certain simplicial quotient maps.
Keywords
Cite
@article{arxiv.2109.01154,
title = {Partitioning the projective plane and the dunce hat},
author = {Andrés D. Santamaría-Galvis},
journal= {arXiv preprint arXiv:2109.01154},
year = {2022}
}
Comments
15 pages, 6 figures