On the shard intersection order of a Coxeter group

TL;DR

This paper studies the shard intersection order in finite Coxeter groups, providing combinatorial models for classical types, proving EL-shellability, and revealing symmetric boolean decompositions that extend known structures in noncrossing partitions.

Contribution

It introduces combinatorial models for shard intersections in all classical types and proves the shard intersection order is EL-shellable, also establishing symmetric boolean decompositions.

Findings

Shard intersection order is EL-shellable.

Provides combinatorial models for classical types.

Establishes symmetric boolean decompositions.

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.