Poset edge-labellings and left modularity

DOI10.1016/J.EJC.2004.07.010MaRDI QIDQ2581463zbMATH OpenOpenAlexFDO

Authors Hugh Thomas, Peter R. W. McNamara

Publication date 10 January 2006

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0211126

zbMATH Keywords

EL-labellingLeft modularitySupersolvable lattice

Mathematics Subject Classification ID

Algebraic aspects of posets (06A11)

Abstract: It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1,2,...,n without repetition. These labellings are called S_n EL-labellings, and having such a labelling is also equivalent to possessing a maximal chain of left modular elements. In the case of an ungraded lattice, there is a natural extension of S_n EL-labellings, called interpolating labellings. We show that admitting an interpolating labelling is again equivalent to possessing a maximal chain of left modular elements. Furthermore, we work in the setting of a general bounded poset as all the above results generalize to this case. We conclude by applying our results to show that the lattice of non-straddling partitions, which is not graded in general, has a maximal chain of left modular elements.

Recommendations

• Graded left modular lattices are supersolvable
• An 𝐸𝐿-labeling of the subgroup lattice
• EL-labelings, supersolvability and 0-Hecke algebra actions on posets
• Chains of modular elements and shellability
• Supersolvable LL-lattices of binary trees

Cites work

• EL-labelings, supersolvability and 0-Hecke algebra actions on posets
• Graded left modular lattices are supersolvable
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 718868 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• Left-modular elements of lattices
• Möbius functions of lattices
• Ordered structures and partitions
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Shellable Nonpure Complexes and Posets. I
• Shellable nonpure complexes and posets. II
• Supersolvable lattices

Cited in

(18)

• Peckness of edge posets
• Two posets of noncrossing set partitions
• EL-labelings, supersolvability and 0-Hecke algebra actions on posets
• Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
• Antichain cutsets of strongly connected posets
• Frankl's conjecture for subgroup lattices
• Graded left modular lattices are supersolvable
• scientific article; zbMATH DE number 6704961 (Why is no real title available?)
• An 𝐸𝐿-labeling of the subgroup lattice
• Noncrossing partitions and representations of quivers.
• Chains of modular elements and shellability
• A new subgroup lattice characterization of finite solvable groups.
• The \(m\)-cover posets and their applications
• A modular characterization of supersolvable lattices
• A broad class of shellable lattices
• Extremality, left-modularity and semidistributivity
• Leveled partially ordered sets
• An analogue of distributivity for ungraded lattices

This page was built for publication: Poset edge-labellings and left modularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581463)