Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information

# The Sorting Order on a Coxeter Group

Abstract : Let $(W,S)$ be an arbitrary Coxeter system. For each sequence $\omega =(\omega_1,\omega_2,\ldots) \in S^{\ast}$ in the generators we define a partial order― called the $\omega \mathsf{-sorting order}$ ―on the set of group elements $W_{\omega} \subseteq W$ that occur as finite subwords of $\omega$ . We show that the $\omega$-sorting order is a supersolvable join-distributive lattice and that it is strictly between the weak and strong Bruhat orders on the group. Moreover, the $\omega$-sorting order is a "maximal lattice'' in the sense that the addition of any collection of edges from the Bruhat order results in a nonlattice. Along the way we define a class of structures called $\mathsf{supersolvable}$ $\mathsf{antimatroids}$ and we show that these are equivalent to the class of supersolvable join-distributive lattices.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [15 references]

https://hal.inria.fr/hal-01185135
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 19, 2015 - 11:40:45 AM
Last modification on : Saturday, February 27, 2021 - 4:02:05 PM
Long-term archiving on: : Friday, November 20, 2015 - 10:26:10 AM

### File

dmAJ0135.pdf
Publisher files allowed on an open archive

### Citation

Drew Armstrong. The Sorting Order on a Coxeter Group. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Viña del Mar, Chile. pp.411-416, ⟨10.46298/dmtcs.3602⟩. ⟨hal-01185135⟩

Record views