2022/09/30 by Stephen Lacina, Lacina, Stephen
Computer Science · Mathematics · #05E45 (Secondary) #06A07 (Primary) #Advanced Algebra and Logic #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2209.15142
openalex publication_date 2022/09/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper introduces a partial order on the maximal chains of any finite bounded poset P which has a CL-labeling λ. We call this the maximal chain descent order induced by λ, denoted Pλ(2). As a first example, letting P be the Boolean lattice and λ its standard EL-labeling gives Pλ(2) isomorphic to the weak order of type A. We discuss in depth other seemingly well-structured examples: the max-min EL-labeling of the partition lattice gives maximal chain descent order isomorphic to a partial order on certain labeled trees, and particular cases of the linear extension EL-labelings of finite distributive lattices produce maximal chain descent orders isomorphic to partial orders on standard Young tableaux. We observe that the order relations which one might expect to be the cover relations, those given by the "polygon moves" whose transitive closure defines the maximal chain descent order, are not always cover relations. Several examples illustrate this fact. Nonetheless, we characterize the EL-labelings for which every polygon move gives a cover relation, and we prove many well known EL-labelings do have the expected cover relations. One motivation for Pλ(2) is that its linear extensions give all of the shellings of the order complex of P whose restriction maps are defined by the descents with respect to λ. This yields strictly more shellings of P than the lexicographic ones induced by λ. Thus, the maximal chain descent order Pλ(2) might be thought of as encoding the structure of the set of shellings induced by λ.