Chains of modular elements and shellability
From MaRDI portal
Abstract: Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a conjecture of Hersh. Under certain circumstances, we can find shellings of higher skeleta. For instance, if the left-modular chain consists of every other element of some maximum length chain, then L itself is shellable. We apply these results to give a new characterization of finite solvable groups in terms of the topology of subgroup lattices. Our main tool relaxes the conditions for an EL-labeling, allowing multiple ascending chains as long as they are lexicographically before non-ascending chains. We extend results from the theory of EL-shellable posets to such labelings. The shellability of certain skeleta is one such result. Another is that a poset with such a labeling is homotopy equivalent (by discrete Morse theory) to a cell complex with cells in correspondence to weakly descending chains.
Recommendations
Cites work
- scientific article; zbMATH DE number 67429 (Why is no real title available?)
- scientific article; zbMATH DE number 3796014 (Why is no real title available?)
- A Note on Solvable Groups
- A new subgroup lattice characterization of finite solvable groups.
- Algebraic shifting and sequentially Cohen-Macaulay simplicial complexes
- An 𝐸𝐿-labeling of the subgroup lattice
- Chains of modular elements and lattice connectivity
- Chordal and sequentially Cohen-Macaulay clutters
- Combinatorics and commutative algebra.
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Discrete Morse functions from lexicographic orders
- Erdős-Ko-Rado theorems for simplicial complexes
- General lexicographic shellability and orbit arrangements
- Graded left modular lattices are supersolvable
- Left-modular elements of lattices
- Morse theory for cell complexes
- Obstructions to shellability
- On optimizing discrete Morse functions
- On the shellability of the order complex of the subgroup lattice of a finite group
- Optimal decision trees on simplicial complexes
- Poset edge-labellings and left modularity
- Poset topology: tools and applications
- Shellable Nonpure Complexes and Posets. I
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Shellable nonpure complexes and posets. II
- Simplicial complexes of graphs
- Supersolvable lattices
- The Möbius function of a composition poset
- The top homology of the lattice of subgroups of a soluble group
Cited in
(8)- On the structure of flat chains modulo \(p\)
- Chains of modular elements and lattice connectivity
- scientific article; zbMATH DE number 718868 (Why is no real title available?)
- Graded left modular lattices are supersolvable
- Poset edge-labellings and left modularity
- A broad class of shellable lattices
- Shellability and regularity of chain complexes over a principal ideal domain
- An 𝐸𝐿-labeling of the subgroup lattice
This page was built for publication: Chains of modular elements and shellability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423651)