Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
From MaRDI portal
Publication:2397710
Abstract: We prove that the noncrossing partition lattices associated with the complex reflection groups for admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property and their rank-generating polynomials are symmetric, unimodal, and -nonnegative. We use computer computations to complete the proof that every noncrossing partition lattice associated with a well-generated complex reflection group is strongly Sperner, thus answering affirmatively a question raised by D. Armstrong.
Recommendations
- Symmetric chain decompositions and the strong Sperner property for noncrossing partition lattices
- Shellability of noncrossing partition lattices
- On the structure of the lattice of noncrossing partitions
- Noncrossing Partitions for the GroupDn
- EL-shellability and noncrossing partitions associated with well-generated complex reflection groups
Cites work
- scientific article; zbMATH DE number 5601747 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 1176965 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 1792287 (Why is no real title available?)
- scientific article; zbMATH DE number 3065933 (Why is no real title available?)
- A PARTIAL ORDER ON THE ORTHOGONAL GROUP
- A counterexample to the generalisation of Sperner's theorem
- A finite Coxeter group the weak Bruhat order of which is not symmetric chain
- A partial order on the symmetric group and new \(K(\pi,1)\)'s for the braid groups
- A simple counterexample to a conjecture of Rota
- Chain enumeration and non-crossing partitions
- Chains in the Noncrossing Partition Lattice
- Counting factorizations of Coxeter elements into products of reflections.
- Deformation of chains via a local symmetric group action
- EL-shellability and noncrossing partitions associated with well-generated complex reflection groups
- Enumerative properties of generalized associahedra
- Eulerian Numbers
- Finite Unitary Reflection Groups
- Finite complex reflection arrangements are \(K(\pi,1)\)
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Hurwitz orbits of primitive factorizations of a Coxeter element.
- Invariants of Finite Groups Generated by Reflections
- Non-crossing partition lattices in finite real reflection groups
- Non-crossing partitions for classical reflection groups
- Non-crossing partitions of type \((e,e,r)\).
- Noncrossing Partitions for the GroupDn
- Noncrossing Partitions in Surprising Locations
- Noncrossing partitions
- On a lemma of Littlewood and Offord
- On a problem of Rota
- On chains and Sperner k-families in ranked posets
- On non-conjugate Coxeter elements in well-generated reflection groups
- On the shard intersection order of a Coxeter group
- On the structure of the lattice of noncrossing partitions
- Product partial orders with the Sperner property
- Reflection Subquotients of Unitary Reflection Groups
- Regular elements of finite reflection groups
- Shellability of noncrossing partition lattices
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Some properties of crossings and partitions
- Sufficient Conditions for a Symmetric Chain Order
- Superantichains in the Lattice of Partitions of a Set
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The development version of the \texttt{CHEVIE} package of \texttt{GAP3}.
- The dual braid monoid
- Unitary reflection groups and cohomology
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- \(K(\pi,1)\)'s for Artin groups of finite type.
Cited in
(8)- A combinatorial proof of the unimodality and symmetry of weak composition rank sequences
- Gamma-positivity in combinatorics and geometry
- The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner
- Reflection arrangements and ribbon representations
- Unifying the representation of symmetric crossing families and weakly partitive families
- Symmetries on the lattice of \(k\)-bounded partitions
- On the Sperner property for the absolute order on complex reflection groups
- Symmetric chain decompositions and the strong Sperner property for noncrossing partition lattices
This page was built for publication: Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397710)
