Path Covering Spaces of Posets
Abstract
In this paper we extend results concerning a kind of covering space for finite posets that bears some analogy to the topological theory of covering spaces. Previous work focused on ranked, locally-finite posets with a unique minimal element. In this previous work the notion of a covering space based on preservation of path weights was defined, and it was shown that, given a poset, there is a unique universal covering space which has an explicit description. Numerous examples of combinatorially significant posets and their universal covers were explored. In this paper we consider finite posets that have a unique minimal element, but that need not be ranked. We give a combinatorial description of these covering spaces, which we call path covers. We then show these covers naturally form a supersolvable lattice and deduce some of its properties. Finally, we investigate an analogue of deck transformations and give some results relating these transformations, poset automorphisms, and the automorphisms of the lattice of path covers.
Related
- Besicovitch Covering on Alexandrov Spaces
- Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem
- The renorming-stable ball covering property and C(K)-spaces
- Mordukhovich Derivatives and Covering Constant for Set-Valued Metric Projection in General Banach Spaces
- Covering Projective Height Balls by Subspaces in Rigid Adelic Spaces
BibTeX
@misc{froese2026path,
title = {{Path Covering Spaces of Posets}},
author = {Matteus Froese and Ian George},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.20890},
eprint = {2610.20890},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.20890},
}
RIS
TY - UNPB
TI - Path Covering Spaces of Posets
AU - Matteus Froese
AU - Ian George
PY - 2026
DA - 2026/10/14
PB - arXiv
DO - 10.48550/arxiv.2610.20890
UR - https://arxiv.org/abs/2610.20890
AB - In this paper we extend results concerning a kind of covering space for finite posets that bears some analogy to the topological theory of covering spaces. Previous work focused on ranked, locally-finite posets with a unique minimal element. In this previous work the notion of a covering space based on preservation of path weights was defined, and it was shown that, given a poset, there is a unique universal covering space which has an explicit description. Numerous examples of combinatorially significant posets and their universal covers were explored. In this paper we consider finite posets that have a unique minimal element, but that need not be ranked. We give a combinatorial description of these covering spaces, which we call path covers. We then show these covers naturally form a supersolvable lattice and deduce some of its properties. Finally, we investigate an analogue of deck transformations and give some results relating these transformations, poset automorphisms, and the automorphisms of the lattice of path covers.
ER -