A lexicographic shellability characterization of geometric lattices

DOI10.1016/J.JCTA.2013.11.001zbMATH Open1284.06013arXiv1108.2056OpenAlexW2043726320WikidataQ57443089 ScholiaQ57443089MaRDI QIDQ2434880FDOQ2434880

Authors: Ruth Davidson, Patricia Hersh 

Publication date: 31 January 2014

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

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}.

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

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.

zbMATH Keywords

shellabilityorder complexgeometric latticeMöbius function

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On geometric semilattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Supersolvable lattices
• Finite lattices and Jordan-Hölder sets
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• 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
• On the shellability of the order complex of the subgroup lattice of a finite group
• An 𝐸𝐿-labeling of the subgroup lattice
• Inequalities for the h-vectors and flag h-vectors of geometric lattices
• A note on linear extensions of irreducible elements in a finite lattice
• Supersolvable LL-lattices of binary trees

Cited In (8)

• Lattice of all subsets of a finite set and partition lattice of a \(n\)-set.
• On geometric semilattices
• Title not available (Why is that?)
• The \(h,k\)-equal partition lattice is EL-shellable when \(h \geq k\)
• A condition for modular lattices
• Title not available (Why is that?)
• A broad class of shellable lattices
• Shellability of posets of labeled partitions and arrangements defined by root systems

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)