A modular characterization of supersolvable lattices
From MaRDI portal
Publication:5164029
DOI10.1090/proc/15645OpenAlexW3107109744MaRDI QIDQ5164029
Stephan Foldes, Russ Woodroofe
Publication date: 9 November 2021
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.11657
Combinatorics of partially ordered sets (06A07) Algebraic combinatorics (05E99) Semimodular lattices, geometric lattices (06C10) Modular lattices, complemented lattices (06C99)
Cites Work
- Unnamed Item
- Unnamed Item
- Irreducible representations of semisimple algebraic groups and supersolvable lattices.
- Factoring the characteristic polynomial of a lattice
- An analogue of distributivity for ungraded lattices
- Finite lattices and Jordan-Hölder sets
- Chain decomposition and the flag \(f\)-vector.
- Left-modular elements of lattices
- EL-labelings, supersolvability and 0-Hecke algebra actions on posets
- Optimum basis of finite convex geometry
- Supersolvable lattices
- Graded left modular lattices are supersolvable
- Poset edge-labellings and left modularity
- Lattice Theory: Foundation
- Continuous partition lattice
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Modular Constructions for Combinatorial Geometries
- On Realization of Bjorner's 'Continuous Partition Latice' by Measurable Partitions
- Two Posets of Noncrossing Partitions Coming From Undesired Parking Spaces