On the shard intersection order of a Coxeter group

DOI10.1137/110847202MaRDI QIDQ5408599zbMATH OpenOpenAlexFDO

Authors T. Kyle Petersen

Publication date 10 April 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Coxeter groupnoncrossing partitionEL-shellabilitysymmetric Boolean decompositionshard intersection order

Mathematics Subject Classification ID

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

Abstract: Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the case of the symmetric group, we provide combinatorial models for shard intersections of all classical types, and use this understanding to prove the shard intersection order is EL-shellable. Further, inspired by work of Simion and Ullman on the lattice of noncrossing partitions, we show that the shard intersection order on the symmetric group admits a symmetric boolean decomposition, i.e., a partition into disjoint boolean algebras whose middle ranks coincide with the middle rank of the poset. Our decomposition also yields a new symmetric boolean decomposition of the noncrossing partition lattice.

Recommendations

• Noncrossing partitions and the shard intersection order
• Noncrossing partitions and the shard intersection order
• Shellability of noncrossing partition lattices
• EL-Shellability of generalized noncrossing partitions associated to well-generated complex reflection groups (extended abstract)
• Noncrossing partitions, Bruhat order and the cluster complex

Cited in

(14)

• Gamma-positivity in combinatorics and geometry
• Noncrossing partitions and the shard intersection order
• The core label order of a congruence-uniform lattice
• The Worpitzky identity for the groups of signed and even-signed permutations
• Noncrossing arc diagrams and canonical join representations
• A combinatorial approach to scattering diagrams
• On the lattice property of shard orders
• Meet-distributive lattices have the intersection property
• Counting Dyck paths by area and rank
• Polynomials with palindromic and unimodal coefficients
• Distributive lattices have the intersection property.
• Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
• EL-Shellability of generalized noncrossing partitions associated to well-generated complex reflection groups (extended abstract)
• Hochschild lattices and shuffle lattices

This page was built for publication: On the shard intersection order of a Coxeter group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408599)