An analogue of distributivity for ungraded lattices
From MaRDI portal
Publication:862986
DOI10.1007/S11083-006-9046-9zbMATH Open1134.06003arXivmath/0502278OpenAlexW2023233761MaRDI QIDQ862986FDOQ862986
Publication date: 25 January 2007
Published in: Order (Search for Journal in Brave)
Abstract: In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Other than distributive lattices, the main examples of trim lattices are the Tamari lattices and various generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim, and we conjecture that all Cambrian lattices are trim.
Full work available at URL: https://arxiv.org/abs/math/0502278
Recommendations
- Some theorems on modular lattices and distributive lattices
- Distributive lattices with sufficiently many chain intervals
- Lattices of retracts of direct products of two finite chains and notes on retracts of lattices
- Finite distributive lattices are congruence lattices of almost-geometric lattices
- Graded left modular lattices are supersolvable
- A modular characterization of supersolvable lattices
- scientific article; zbMATH DE number 624978
- Extremality, left-modularity and semidistributivity
- On maximal sublattices of finite lattices
- scientific article; zbMATH DE number 572137
Structure theory of lattices (06B05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Modular lattices, Desarguesian lattices (06C05)
Cites Work
- Combinatorics of Coxeter Groups
- Title not available (Why is that?)
- Shellable nonpure complexes and posets. II
- Title not available (Why is that?)
- Cambrian lattices.
- Supersolvable lattices
- Hyperplane arrangements with a lattice of regions
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Primes, irreducibles and extremal lattices
- Möbius functions of lattices
- Title not available (Why is that?)
- Left-modular elements of lattices
- EL-labelings, supersolvability and 0-Hecke algebra actions on posets
- Poset edge-labellings and left modularity
- Monoïdes préordonnés et chaînes de Malcev
- Tamari lattices and noncrossing partitions in type \(B\)
Cited In (21)
- Ungarian Markov chains
- Trimness of closed intervals in Cambrian semilattices
- A modular characterization of supersolvable lattices
- Noncrossing partitions and representations of quivers
- Extremality, left-modularity and semidistributivity
- Coloring groups
- Positivity results on ribbon Schur function differences
- The grading numbers of direct product of distributive lattices
- Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
- Rowmotion on \(m\)-Tamari and biCambrian lattices
- Independence posets
- Ballot-noncrossing partitions
- Combinatorics of \((m, n)\)-word lattices
- SB-lattices, distributivity, and Bruhat order on sortable elements.
- The \(m\)-cover posets and their applications
- A geometric and combinatorial exploration of Hochschild lattices
- Semidistrim Lattices
- Semidistrim lattices
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Bubble lattices. I: Structure
- The steep-bounce zeta map in parabolic Cataland
This page was built for publication: An analogue of distributivity for ungraded lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862986)