Symmetric decompositions and the strong Sperner property for noncrossing partition lattices

DOI10.1007/S10801-016-0723-5zbMATH Open1423.06009arXiv1509.06942OpenAlexW2949071579MaRDI QIDQ2397710FDOQ2397710

Authors: Henri Mühle 

Publication date: 23 May 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We prove that the noncrossing partition lattices associated with the complex reflection groups $G(d,d,n)$ for $d,ngeq2$ 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 $gamma$-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.

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

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

zbMATH Keywords

symmetric chain decompositionsstrongly Sperner posetsnoncrossing partition latticessymmetric Boolean decompositionswell-generated complex reflection groups

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Cites Work

• The development version of the \texttt{CHEVIE} package of \texttt{GAP3}.
• Product partial orders with the Sperner property
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Title not available (Why is that?)
• Title not available (Why is that?)
• Invariants of Finite Groups Generated by Reflections
• Finite complex reflection arrangements are \(K(\pi,1)\)
• Finite Unitary Reflection Groups
• Chain enumeration and non-crossing partitions
• Non-crossing partitions for classical reflection groups
• Regular elements of finite reflection groups
• Noncrossing partitions
• The dual braid monoid
• Noncrossing Partitions in Surprising Locations
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Title not available (Why is that?)
• On the structure of the lattice of noncrossing partitions
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Title not available (Why is that?)
• A partial order on the symmetric group and new \(K(\pi,1)\)'s for the braid groups
• Some properties of crossings and partitions
• Eulerian Numbers
• On a lemma of Littlewood and Offord
• Hurwitz orbits of primitive factorizations of a Coxeter element.
• Title not available (Why is that?)
• \(K(\pi,1)\)'s for Artin groups of finite type.
• Enumerative properties of generalized associahedra
• A PARTIAL ORDER ON THE ORTHOGONAL GROUP
• Noncrossing Partitions for the GroupDn
• Non-crossing partition lattices in finite real reflection groups
• Unitary reflection groups and cohomology
• Reflection Subquotients of Unitary Reflection Groups
• Deformation of chains via a local symmetric group action
• Sufficient Conditions for a Symmetric Chain Order
• On the shard intersection order of a Coxeter group
• Title not available (Why is that?)
• Non-crossing partitions of type \((e,e,r)\).
• Shellability of noncrossing partition lattices
• EL-shellability and noncrossing partitions associated with well-generated complex reflection groups
• On non-conjugate Coxeter elements in well-generated reflection groups
• Counting factorizations of Coxeter elements into products of reflections.
• Chains in the Noncrossing Partition Lattice
• On chains and Sperner k-families in ranked posets
• On a problem of Rota
• A simple counterexample to a conjecture of Rota
• A counterexample to the generalisation of Sperner's theorem
• Superantichains in the Lattice of Partitions of a Set
• A finite Coxeter group the weak Bruhat order of which is not symmetric chain

Cited In (8)

• Gamma-positivity in combinatorics and geometry
• On the Sperner property for the absolute order on complex reflection groups
• Symmetries on the lattice of \(k\)-bounded partitions
• Reflection arrangements and ribbon representations
• Unifying the representation of symmetric crossing families and weakly partitive families
• The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner
• A combinatorial proof of the unimodality and symmetry of weak composition rank sequences
• Symmetric chain decompositions and the strong Sperner property for noncrossing partition lattices

Uses Software

• SageMath
• CHEVIE
• Sage-Combinat

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)