A lexicographic shellability characterization of geometric lattices

DOI10.1016/J.JCTA.2013.11.001MaRDI QIDQ2434880zbMATH OpenOpenAlexWikidataFDO

Authors Ruth Davidson, Patricia Hersh

Publication date 31 January 2014

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

geometric latticeMöbius functionorder complexshellability

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorics of partially ordered sets (06A07) Semimodular lattices, geometric lattices (06C10)

Abstract: Geometric lattices are characterized in this paper as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are shown to be exactly those finite lattices such that every ordering on the join-irreducibles induces a lexicographic shelling. This new characterization fits into a similar paradigm as McNamara's characterization of supersolvable lattices as those lattices admitting a different type of lexicographic shelling, namely one in which each maximal chain is labeled with a permutation of {1,...,n}.

Review text

In this interesting paper, the authors characterize geometric lattices. The following characterizations of geometric lattices are proved. Theorem. Let \(L\) be a finite atomic lattice. Then \(L\) is geometric if and only if every atom ordering induces a minimal labeling that is an \(EL\)-labeling. Theorem. A finite lattice \(L\) is a geometric lattice if and only if every ordering of the join-irreducibles induces a minimal labeling \(\lambda_{\gamma}\) which is an \(EL\)-labeling. The following theorem gives a condition, under which a finite lattice is semimodular. Theorem. Let \(L\) be a finite lattice with \(|\text{JoinIrred}(L)|=n\). Suppose that for every linear extension \(\gamma: \text{JoinIrred}(L)\to [n]\) of the subposet \(\text{JoinIrred}(L)\) of join-irreducibles in \(L\), the resulting minimal labeling \(\lambda_{\gamma}\) is an \(EL\)-labeling on \(L\). Then \(L\) is (upper) semimodular.

Recommendations

• On geometric semilattices
• A characterization of a semimodular lattice
• scientific article; zbMATH DE number 3877251
• scientific article; zbMATH DE number 4023348
• Lattice of all subsets of a finite set and partition lattice of a \(n\)-set.

Cites work

• A note on linear extensions of irreducible elements in a finite lattice
• An 𝐸𝐿-labeling of the subgroup lattice
• Bruhat order of Coxeter groups and shellability
• Combinatorial methods in the theory of Cohen-Macaulay rings
• EL-labelings, supersolvability and 0-Hecke algebra actions on posets
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Finite lattices and Jordan-Hölder sets
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 67325 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• Inequalities for the h-vectors and flag h-vectors of geometric lattices
• On geometric semilattices
• On the shellability of the order complex of the subgroup lattice of a finite group
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Supersolvable lattices
• Supersolvable LL-lattices of binary trees

Cited in

(8)

• On geometric semilattices
• Shellability of posets of labeled partitions and arrangements defined by root systems
• A condition for modular lattices
• The \(h,k\)-equal partition lattice is EL-shellable when \(h \geq k\)
• scientific article; zbMATH DE number 3877251 (Why is no real title available?)
• scientific article; zbMATH DE number 2077648 (Why is no real title available?)
• Lattice of all subsets of a finite set and partition lattice of a \(n\)-set.
• A broad class of shellable lattices

This page was built for publication: A lexicographic shellability characterization of geometric lattices

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