## Abstract

Let (W,S) be an arbitrary Coxeter system. For each sequence ω = (ω _{1}, ω _{2},. .) ∈ S* in the generators we define a partial order-called the ω-sorting order-on the set of group elements W _{ω} ⊆ W that occur as finite subwords of !. We show that the ω-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 ω-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 supersolvable antimatroids and we show that these are equivalent to the class of supersolvable join-distributive lattices.

Original language | English (US) |
---|---|

Pages | 411-416 |

Number of pages | 6 |

State | Published - Dec 1 2008 |

Externally published | Yes |

Event | 20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08 - Valparaiso, Chile Duration: Jun 23 2008 → Jun 27 2008 |

### Other

Other | 20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08 |
---|---|

Country/Territory | Chile |

City | Valparaiso |

Period | 6/23/08 → 6/27/08 |

## Keywords

- Antimatroid
- Convex geometry
- Coxeter group
- Join-distributive lattice
- Supersolvable lattice

## ASJC Scopus subject areas

- Algebra and Number Theory