The sorting order on a Coxeter group

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationFPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics
Pages411-416
Number of pages6
StatePublished - 2008
Externally publishedYes
Event20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08 - Valparaiso, Chile
Duration: Jun 23 2008Jun 27 2008

Other

Other20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08
CountryChile
CityValparaiso
Period6/23/086/27/08

Fingerprint

Coxeter Group
Sorting
Bruhat Order
Distributive Lattice
Join
Antimatroid
Subword
Partial Order
Strictly
Generator
Arbitrary
Class

Keywords

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

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

Armstrong, D. (2008). The sorting order on a Coxeter group. In FPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics (pp. 411-416)

The sorting order on a Coxeter group. / Armstrong, Drew.

FPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics. 2008. p. 411-416.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Armstrong, D 2008, The sorting order on a Coxeter group. in FPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics. pp. 411-416, 20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08, Valparaiso, Chile, 6/23/08.
Armstrong D. The sorting order on a Coxeter group. In FPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics. 2008. p. 411-416
Armstrong, Drew. / The sorting order on a Coxeter group. FPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics. 2008. pp. 411-416
@inproceedings{da2c4abe396b4ce4bfe32b6da0a78c43,
title = "The sorting order on a Coxeter group",
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.",
keywords = "Antimatroid, Convex geometry, Coxeter group, Join-distributive lattice, Supersolvable lattice",
author = "Drew Armstrong",
year = "2008",
language = "English (US)",
pages = "411--416",
booktitle = "FPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics",

}

TY - GEN

T1 - The sorting order on a Coxeter group

AU - Armstrong, Drew

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Antimatroid

KW - Convex geometry

KW - Coxeter group

KW - Join-distributive lattice

KW - Supersolvable lattice

UR - http://www.scopus.com/inward/record.url?scp=84860442284&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860442284&partnerID=8YFLogxK

M3 - Conference contribution

SP - 411

EP - 416

BT - FPSAC'08 - 20th International Conference on Formal Power Series and Algebraic Combinatorics

ER -