Related papers: SB-Labelings, Distributivity, and Bruhat Order on …

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

We show that the Coxeter-sortable elements in a finite Coxeter group W are the minimal congruence-class representatives of a lattice congruence of the weak order on W. We identify this congruence as the Cambrian congruence on W, so that the…

The $\gamma$-Cambrian semilattices $\mathcal{C}_{\gamma}$ defined by Reading and Speyer are a family of meet-semilattices associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, and they are lattices if and only if $W$ is…

In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…

We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter groups. We collect and expand upon known results for…

We classify surjective lattice homomorphisms $W\to W'$ between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences $\Theta$ on $W$ such that the quotient $W/\Theta$ is isomorphic to $W'$. Surprisingly,…

For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

We study parabolic aligned elements associated with the type-$B$ Coxeter group and the so-called linear Coxeter element. These elements were introduced algebraically in (M\"uhle and Williams, 2019) for parabolic quotients of finite Coxeter…

For an arbitrary Coxeter group $W$, David Speyer and Nathan Reading defined Cambrian semilattices $C_{\gamma}$ as semilattice quotients of the weak order on $W$ induced by certain semilattice homomorphisms. In this article, we define an…

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…

We classify all quotients $W/W_J$ up to isomorphism in Bruhat order, with $(W,S)$ a Coxeter system and $W_J$ a parabolic subgroup of $W$. In particular, the non-trivial isomorphisms fall into a small number of cases which are highly…

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof…

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we…

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

We refine a conjecture by Lehrer and Solomon on the structure of the Orlik-Solomon algebra of a finite Coxeter group $W$ and relate it to the descent algebra of $W$. As a result, we claim that both the group algebra of $W$, as well as the…

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in…