Equivalences and Distinctions in Lexicographic Shellability of Posets
Stephen Lacina, Grace Stadnyk
TL;DR
The paper investigates how different notions of lexicographic shellability relate, introducing RFAS and LCRFAS as new recursive tools. It proves TCL-shellability is equivalent to CC-shellability and shows RC-type frameworks can characterize CC-shellability via RFAS, with LC ensuring a compatible labeling exists. It provides small counterexamples of posets that are CC-shellable but not CL-shellable, and establishes a tight equivalence between TCL-shellability and CC-shellability while clarifying when RFAS suffices. The work also outlines open questions about the limits of RFAS/LCRFAS and their connections to EC/EL frameworks, guiding future research in the topology of posets.
Abstract
We present two perhaps surprisingly small posets, one graded and one non-graded, that are CC-shellable in the sense of Kozlov and TCL-shellable in the sense of Hersh, but not CL-shellable in the sense of Björner and Wachs. In the spirit of Björner and Wachs' recursive atom orderings (RAO) and Hersh and Stadnyk's generalized recursive atom orderings (GRAO), we also introduce a notion called recursive first atom sets (RFAS). An RFAS is a set of conditions on the atoms of each interval in a finite bounded poset $P$ that are necessary for CC-shellability of $P$ and sufficient for shellability of $P$. We also prove that under an extra condition, $P$ is CC-shellable if and only if it admits an RFAS, in the same way that RAOs provide a reformulation of CL-shellability.
