combinatorial interpretations in affine coxeter groups
play

Combinatorial interpretations in affine Coxeter groups Christopher - PowerPoint PPT Presentation

Oct 15, 2022 •132 likes •1.5k views

Combinatorial interpretations in affine Coxeter groups Christopher R. H. Hanusa Queens College, CUNY Joint work with Brant C. Jones, James Madison University Coxeter Groups Interpretations Application Future work What is a Coxeter group? A

  1. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups (Finite) n -permutations S n An n -permutation is a permutation of { 1 , 2 , . . . , n } , (e.g. 2 1 4 5 3 6). Every n -permutation is a product of adjacent transpositions . ◮ s i : ( i ) ↔ ( i + 1). (e.g. s 4 = 1 2 3 5 4 6). Example. Write 2 1 4 5 3 6 as s 3 s 4 s 1 . This is a Coxeter group: ◮ Generators: s 1 , . . . , s n − 1 ◮ s i s j = s j s i when | i − j | ≥ 2 (commutation relation) Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 4 / 37

  2. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups (Finite) n -permutations S n An n -permutation is a permutation of { 1 , 2 , . . . , n } , (e.g. 2 1 4 5 3 6). Every n -permutation is a product of adjacent transpositions . ◮ s i : ( i ) ↔ ( i + 1). (e.g. s 4 = 1 2 3 5 4 6). Example. Write 2 1 4 5 3 6 as s 3 s 4 s 1 . This is a Coxeter group: ◮ Generators: s 1 , . . . , s n − 1 ◮ s i s j = s j s i when | i − j | ≥ 2 (commutation relation) ◮ s i s j s i = s j s i s j when | i − j | = 1 (braid relation) Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 4 / 37

  3. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups (Finite) n -permutations S n An n -permutation is a permutation of { 1 , 2 , . . . , n } , (e.g. 2 1 4 5 3 6). Every n -permutation is a product of adjacent transpositions . ◮ s i : ( i ) ↔ ( i + 1). (e.g. s 4 = 1 2 3 5 4 6). Example. Write 2 1 4 5 3 6 as s 3 s 4 s 1 . This is a Coxeter group: ◮ Generators: s 1 , . . . , s n − 1 ◮ s i s j = s j s i when | i − j | ≥ 2 (commutation relation) ◮ s i s j s i = s j s i s j when | i − j | = 1 (braid relation) s 1 s 2 s 3 ... s n � 2 s n � 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 4 / 37

  4. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n ◮ Generators: s 0 , s 1 , . . . , s n − 1 s 0 ◮ Relations: s 1 s 2 s 3 ... s n � 2 s n � 1 ◮ s 0 has a braid relation with s 1 and s n − 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 5 / 37

  5. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n ◮ Generators: s 0 , s 1 , . . . , s n − 1 s 0 ◮ Relations: s 1 s 2 s 3 ... s n � 2 s n � 1 ◮ s 0 has a braid relation with s 1 and s n − 1 ◮ How does this impact 1-line notation? Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 5 / 37

  6. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n ◮ Generators: s 0 , s 1 , . . . , s n − 1 s 0 ◮ Relations: s 1 s 2 s 3 ... s n � 2 s n � 1 ◮ s 0 has a braid relation with s 1 and s n − 1 ◮ How does this impact 1-line notation? ◮ Perhaps interchanges 1 and n ? Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 5 / 37

  7. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n ◮ Generators: s 0 , s 1 , . . . , s n − 1 s 0 ◮ Relations: s 1 s 2 s 3 ... s n � 2 s n � 1 ◮ s 0 has a braid relation with s 1 and s n − 1 ◮ How does this impact 1-line notation? ◮ Perhaps interchanges 1 and n ? ◮ Not quite! (Would add a relation) Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 5 / 37

  8. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n ◮ Generators: s 0 , s 1 , . . . , s n − 1 s 0 ◮ Relations: s 1 s 2 s 3 ... s n � 2 s n � 1 ◮ s 0 has a braid relation with s 1 and s n − 1 s 0 ◮ How does this impact 1-line notation? s 1 s n � 1 ◮ Perhaps interchanges 1 and n ? ◮ Not quite! (Would add a relation) s 2 s n � 2 ◮ Better to view graph as: ◮ Every generator is the same. s 3 ... Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 5 / 37

  9. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n (G. Lusztig 1983, H. Eriksson, 1994) w ∈ � Write an element � S n in 1-line notation as a permutation of Z . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 6 / 37

  10. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n (G. Lusztig 1983, H. Eriksson, 1994) w ∈ � Write an element � S n in 1-line notation as a permutation of Z . Generators transpose infinitely many pairs of entries: s i : (i) ↔ (i+1) . . . ( n + i ) ↔ ( n + i + 1) . . . ( − n + i ) ↔ ( − n + i + 1) . . . In � S 4 , · · · w (-4) w (-3) w (-2) w (-1) w (0) w (1) w (2) w (3) w (4) w (5) w (6) w (7) w (8) w (9) · · · s 1 · · · -4 -2 -3 -1 0 2 1 3 4 6 5 7 8 10 · · · s 0 · · · -3 -4 -2 -1 1 0 2 3 5 4 6 7 9 8 · · · Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 6 / 37

  11. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n (G. Lusztig 1983, H. Eriksson, 1994) w ∈ � Write an element � S n in 1-line notation as a permutation of Z . Generators transpose infinitely many pairs of entries: s i : (i) ↔ (i+1) . . . ( n + i ) ↔ ( n + i + 1) . . . ( − n + i ) ↔ ( − n + i + 1) . . . In � S 4 , · · · w (-4) w (-3) w (-2) w (-1) w (0) w (1) w (2) w (3) w (4) w (5) w (6) w (7) w (8) w (9) · · · s 1 · · · -4 -2 -3 -1 0 2 1 3 4 6 5 7 8 10 · · · s 0 · · · -3 -4 -2 -1 1 0 2 3 5 4 6 7 9 8 · · · s 1 s 0 · · · -2 -4 -3 -1 2 0 1 3 6 4 5 7 10 8 · · · Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 6 / 37

  12. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n (G. Lusztig 1983, H. Eriksson, 1994) w ∈ � Write an element � S n in 1-line notation as a permutation of Z . Generators transpose infinitely many pairs of entries: s i : (i) ↔ (i+1) . . . ( n + i ) ↔ ( n + i + 1) . . . ( − n + i ) ↔ ( − n + i + 1) . . . In � S 4 , · · · w (-4) w (-3) w (-2) w (-1) w (0) w (1) w (2) w (3) w (4) w (5) w (6) w (7) w (8) w (9) · · · s 1 · · · -4 -2 -3 -1 0 2 1 3 4 6 5 7 8 10 · · · s 0 · · · -3 -4 -2 -1 1 0 2 3 5 4 6 7 9 8 · · · s 1 s 0 · · · -2 -4 -3 -1 2 0 1 3 6 4 5 7 10 8 · · · Symmetry: Can think of as integers wrapped around a cylinder. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 6 / 37

  13. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n (G. Lusztig 1983, H. Eriksson, 1994) w ∈ � Write an element � S n in 1-line notation as a permutation of Z . Generators transpose infinitely many pairs of entries: s i : (i) ↔ (i+1) . . . ( n + i ) ↔ ( n + i + 1) . . . ( − n + i ) ↔ ( − n + i + 1) . . . In � S 4 , · · · w (-4) w (-3) w (-2) w (-1) w (0) w (1) w (2) w (3) w (4) w (5) w (6) w (7) w (8) w (9) · · · s 1 · · · -4 -2 -3 -1 0 2 1 3 4 6 5 7 8 10 · · · s 0 · · · -3 -4 -2 -1 1 0 2 3 5 4 6 7 9 8 · · · s 1 s 0 · · · -2 -4 -3 -1 2 0 1 3 6 4 5 7 10 8 · · · Symmetry: Can think of as integers wrapped around a cylinder. w is defined by the window [ � � w (1) , � w (2) , . . . , � w ( n )]. s 1 s 0 = [0 , 1 , 3 , 6] Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 6 / 37

  14. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n s 2 S 3 s 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  15. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n s 2 S 3 s 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  16. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n s 2 S 3 s 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  17. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n s 2 � S 3 s 1 s 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  18. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n s 2 � S 3 s 1 s 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  19. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n s 2 � S 3 s 1 s 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  20. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n s 2 � S 3 s 1 s 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  21. Coxeter Groups Interpretations Application Future work Examples of Coxeter groups Affine n -Permutations � S n — elements correspond to alcoves. s 2 � S 3 s 1 s 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 7 / 37

  22. Coxeter Groups Interpretations Application Future work Properties of Coxeter groups For a elements w in a Coxeter group W , ◮ w may have multiple expressions. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 8 / 37

  23. Coxeter Groups Interpretations Application Future work Properties of Coxeter groups For a elements w in a Coxeter group W , ◮ w may have multiple expressions. ◮ Transfer between them using relations. Example. In S 4 , w = s 1 s 2 s 3 s 1 = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 = s 2 s 1 s 2 s 3 s 1 s 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 8 / 37

  24. Coxeter Groups Interpretations Application Future work Properties of Coxeter groups For a elements w in a Coxeter group W , ◮ w may have multiple expressions. ◮ Transfer between them using relations. Example. In S 4 , w = s 1 s 2 s 3 s 1 = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 = s 2 s 1 s 2 s 3 s 1 s 1 ◮ w has a shortest expression (this length: Coxeter length ) Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 8 / 37

  25. Coxeter Groups Interpretations Application Future work Properties of Coxeter groups For a elements w in a Coxeter group W , ◮ w may have multiple expressions. ◮ Transfer between them using relations. Example. In S 4 , w = s 1 s 2 s 3 s 1 = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 = s 2 s 1 s 2 s 3 s 1 s 1 ◮ w has a shortest expression (this length: Coxeter length ) For a Coxeter group � W , ◮ An induced subgraph of � W ’s Coxeter graph is a subgroup W w ∈ � w = w 0 w , where ◮ Every element � W can be written � w 0 ∈ � W / W is a coset representative and w ∈ W . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 8 / 37

  26. Coxeter Groups Interpretations Application Future work S n as a subgroup of � S n Key concept: View S n as a subgroup of � S n . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 9 / 37

  27. Coxeter Groups Interpretations Application Future work S n as a subgroup of � S n Key concept: View S n as a subgroup of � S n . w = w 0 w , where w 0 ∈ � ◮ Write � S n / S n and w ∈ S n . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 9 / 37

  28. Coxeter Groups Interpretations Application Future work S n as a subgroup of � S n Key concept: View S n as a subgroup of � S n . w = w 0 w , where w 0 ∈ � ◮ Write � S n / S n and w ∈ S n . ◮ w 0 determines the entries; w determines their order. w = [ − 11 , 20 , − 3 , 4 , 11 , 0] ∈ � Example. For � S 6 , w 0 = [ − 11 , − 3 , 0 , 4 , 11 , 20] and w = [1 , 3 , 6 , 4 , 5 , 2] . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 9 / 37

  29. Coxeter Groups Interpretations Application Future work S n as a subgroup of � S n Key concept: View S n as a subgroup of � S n . w = w 0 w , where w 0 ∈ � ◮ Write � S n / S n and w ∈ S n . ◮ w 0 determines the entries; w determines their order. w = [ − 11 , 20 , − 3 , 4 , 11 , 0] ∈ � Example. For � S 6 , w 0 = [ − 11 , − 3 , 0 , 4 , 11 , 20] and w = [1 , 3 , 6 , 4 , 5 , 2] . Many interpretations of these minimal length coset representatives . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 9 / 37

  30. Coxeter Groups Interpretations Application Future work Combinatorial interpretations of � S n / S n � � 4, � 3,7,10 � window notation s 1 s 0 s 2 s 3 s 1 s 0 s 2 s 3 s 1 s 0 reduced abacus expression diagram elements of � � S n S n bounded core partition partition root lattice point � � 1,2,1, � 2 � Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 10 / 37

  31. Coxeter Groups Interpretations Application Future work An abacus model for � S n / S n (James and Kerber, 1981) Given w 0 = [ w 1 , . . . , w n ] ∈ � S n / S n , ◮ Place integers in n runners . � 15 � 14 � 13 � 12 � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 11 / 37

  32. Coxeter Groups Interpretations Application Future work An abacus model for � S n / S n (James and Kerber, 1981) Given w 0 = [ w 1 , . . . , w n ] ∈ � S n / S n , ◮ Place integers in n runners . � 15 � 14 � 13 � 12 ◮ Circled: beads . Empty: gaps � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 11 / 37

  33. Coxeter Groups Interpretations Application Future work An abacus model for � S n / S n (James and Kerber, 1981) Given w 0 = [ w 1 , . . . , w n ] ∈ � S n / S n , ◮ Place integers in n runners . � 15 � 14 � 13 � 12 ◮ Circled: beads . Empty: gaps � 11 � 10 � 9 � 8 ◮ Bijection: Given w 0 , create � 7 � 6 � 5 � 4 an abacus where each runner � 3 � 2 � 1 0 has a lowest bead at w i . 1 2 3 4 Example: [ − 4 , − 3 , 7 , 10] 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 11 / 37

  34. Coxeter Groups Interpretations Application Future work An abacus model for � S n / S n (James and Kerber, 1981) Given w 0 = [ w 1 , . . . , w n ] ∈ � S n / S n , ◮ Place integers in n runners . � 15 � 14 � 13 � 12 ◮ Circled: beads . Empty: gaps � 11 � 10 � 9 � 8 ◮ Bijection: Given w 0 , create � 7 � 6 � 5 � 4 an abacus where each runner � 3 � 2 � 1 0 has a lowest bead at w i . 1 2 3 4 Example: [ − 4 , − 3 , 7 , 10] 5 6 7 8 9 10 11 12 These abaci are flush and balanced. 13 14 15 16 17 18 19 20 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 11 / 37

  35. Coxeter Groups Interpretations Application Future work An abacus model for � S n / S n (James and Kerber, 1981) Given w 0 = [ w 1 , . . . , w n ] ∈ � S n / S n , ◮ Place integers in n runners . � 15 � 14 � 13 � 12 ◮ Circled: beads . Empty: gaps � 11 � 10 � 9 � 8 ◮ Bijection: Given w 0 , create � 7 � 6 � 5 � 4 an abacus where each runner � 3 � 2 � 1 0 has a lowest bead at w i . 1 2 3 4 Example: [ − 4 , − 3 , 7 , 10] 5 6 7 8 9 10 11 12 These abaci are flush and balanced. 13 14 15 16 The generators act nicely on the abacus. 17 18 19 20 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 11 / 37

  36. Coxeter Groups Interpretations Application Future work Action of generators on the abacus ◮ s i acts by interchanging runners i and i + 1. ◮ s 0 acts by interchanging runners 1 and n , with level shifts. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 12 / 37

  37. Coxeter Groups Interpretations Application Future work Action of generators on the abacus ◮ s i acts by interchanging runners i and i + 1. ◮ s 0 acts by interchanging runners 1 and n , with level shifts. Example: Consider [ − 4 , − 3 , 7 , 10] = s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 . Start with id= [1 , 2 , 3 , 4] and apply the generators one by one: � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 [1 , 2 , 3 , 4] Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 12 / 37

  38. Coxeter Groups Interpretations Application Future work Action of generators on the abacus ◮ s i acts by interchanging runners i and i + 1. ◮ s 0 acts by interchanging runners 1 and n , with level shifts. Example: Consider [ − 4 , − 3 , 7 , 10] = s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 . Start with id= [1 , 2 , 3 , 4] and apply the generators one by one: � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 � 3 � 2 � 1 0 s 0 → 1 2 3 4 1 2 3 4 5 6 7 8 5 6 7 8 9 10 11 12 9 10 11 12 13 14 15 16 13 14 15 16 [1 , 2 , 3 , 4] [0 , 2 , 3 , 5] Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 12 / 37

  39. Coxeter Groups Interpretations Application Future work Action of generators on the abacus ◮ s i acts by interchanging runners i and i + 1. ◮ s 0 acts by interchanging runners 1 and n , with level shifts. Example: Consider [ − 4 , − 3 , 7 , 10] = s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 . Start with id= [1 , 2 , 3 , 4] and apply the generators one by one: � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 � 3 � 2 � 1 0 � 3 � 2 � 1 0 s 0 s 1 → → 1 2 3 4 1 2 3 4 1 2 3 4 5 6 7 8 5 6 7 8 5 6 7 8 9 10 11 12 9 10 11 12 9 10 11 12 13 14 15 16 13 14 15 16 13 14 15 16 [1 , 2 , 3 , 4] [0 , 2 , 3 , 5] [0 , 1 , 3 , 6] Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 12 / 37

  40. Coxeter Groups Interpretations Application Future work Action of generators on the abacus ◮ s i acts by interchanging runners i and i + 1. ◮ s 0 acts by interchanging runners 1 and n , with level shifts. Example: Consider [ − 4 , − 3 , 7 , 10] = s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 . Start with id= [1 , 2 , 3 , 4] and apply the generators one by one: � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 � 3 � 2 � 1 0 � 3 � 2 � 1 0 � 3 � 2 � 1 0 s 0 s 1 s 3 → → → 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 5 6 7 8 5 6 7 8 5 6 7 8 5 6 7 8 9 10 11 12 9 10 11 12 9 10 11 12 9 10 11 12 13 14 15 16 13 14 15 16 13 14 15 16 13 14 15 16 [1 , 2 , 3 , 4] [0 , 2 , 3 , 5] [0 , 1 , 3 , 6] [ − 1 , 1 , 4 , 6] Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 12 / 37

  41. Coxeter Groups Interpretations Application Future work Action of generators on the abacus ◮ s i acts by interchanging runners i and i + 1. ◮ s 0 acts by interchanging runners 1 and n , with level shifts. Example: Consider [ − 4 , − 3 , 7 , 10] = s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 . Start with id= [1 , 2 , 3 , 4] and apply the generators one by one: � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 � 3 � 2 � 1 0 � 3 � 2 � 1 0 � 3 � 2 � 1 0 � 3 � 2 � 1 0 s 0 s 1 s 3 s 0 → → → → 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 5 6 7 8 5 6 7 8 5 6 7 8 5 6 7 8 5 6 7 8 9 10 11 12 9 10 11 12 9 10 11 12 9 10 11 12 9 10 11 12 13 14 15 16 13 14 15 16 13 14 15 16 13 14 15 16 13 14 15 16 [1 , 2 , 3 , 4] [0 , 2 , 3 , 5] [0 , 1 , 3 , 6] [ − 1 , 1 , 4 , 6] [ − 1 , 0 , 5 , 6] Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 12 / 37

  42. Coxeter Groups Interpretations Application Future work Combinatorial interpretations of � S n / S n � � 4, � 3,7,10 � window notation s 1 s 0 s 2 s 3 s 1 s 0 s 2 s 3 s 1 s 0 reduced abacus expression diagram elements of � � S n S n bounded core partition partition root lattice point � � 1,2,1, � 2 � Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 13 / 37

  43. Coxeter Groups Interpretations Application Future work Integer partitions and n -core partitions For an integer partition λ = ( λ 1 , . . . , λ k ) drawn as a Ferrers diagram, The hook length of a box is # boxes below and to the right. 10 9 6 5 2 1 7 6 3 2 6 5 2 1 3 2 2 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 14 / 37

  44. Coxeter Groups Interpretations Application Future work Integer partitions and n -core partitions For an integer partition λ = ( λ 1 , . . . , λ k ) drawn as a Ferrers diagram, The hook length of a box is # boxes below and to the right. 10 9 6 5 2 1 7 6 3 2 6 5 2 1 3 2 2 1 An n-core is a partition with no boxes of hook length dividing n . Example. λ is a 4-core, 8-core, 11-core, 12-core, etc. λ is NOT a 1-, 2-, 3-, 5-, 6-, 7-, 9-, or 10-core. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 14 / 37

  45. Coxeter Groups Interpretations Application Future work Core partitions for � S n / S n Elements of � S n / S n are in bijection with n -cores. Bijection: { abaci } ← → { n -cores } Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 15 / 37

  46. Coxeter Groups Interpretations Application Future work Core partitions for � S n / S n Elements of � S n / S n are in bijection with n -cores. Bijection: { abaci } ← → { n -cores } Rule: Read the boundary steps of λ from the abacus: ◮ A bead ↔ vertical step ◮ A gap ↔ horizontal step � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 ← → 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 15 / 37

  47. Coxeter Groups Interpretations Application Future work Core partitions for � S n / S n Elements of � S n / S n are in bijection with n -cores. Bijection: { abaci } ← → { n -cores } Rule: Read the boundary steps of λ from the abacus: ◮ A bead ↔ vertical step ◮ A gap ↔ horizontal step � 11 � 10 � 9 � 8 � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 ← → 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Fact: Abacus flush with n -runners ↔ partition is n -core. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 15 / 37

  48. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  49. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 1 0 1 2 3 0 1 removes all removable 1-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  50. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 0 0 1 2 3 0 1 removes all removable 0-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  51. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 2 0 1 2 3 0 1 removes all removable 2-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  52. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 1 0 1 2 3 0 1 removes all removable 1-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  53. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 3 0 1 2 3 0 1 removes all removable 3-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  54. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 2 0 1 2 3 0 1 removes all removable 2-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  55. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 0 0 1 2 3 0 1 removes all removable 0-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  56. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 3 0 1 2 3 0 1 removes all removable 3-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  57. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 1 0 1 2 3 0 1 removes all removable 1-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  58. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : Applying generator s 0 0 1 2 3 0 1 removes all removable 0-boxes. 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  59. Coxeter Groups Interpretations Application Future work Action of generators on the core partition ◮ Label the boxes of λ with residues. ◮ s i acts by adding or removing boxes with residue i . Example: Let’s see the deconstruction of s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 : 0 1 2 3 0 1 3 0 1 2 3 0 2 3 0 1 2 3 1 2 3 0 1 2 0 1 2 3 0 1 3 0 1 2 3 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 16 / 37

  60. Coxeter Groups Interpretations Application Future work Combinatorial interpretations of � S n / S n � � 4, � 3,7,10 � window notation s 1 s 0 s 2 s 3 s 1 s 0 s 2 s 3 s 1 s 0 reduced abacus expression diagram elements of � � S n S n bounded core partition partition root lattice point � � 1,2,1, � 2 � Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 17 / 37

  61. Coxeter Groups Interpretations Application Future work Bounded partitions for � S n / S n A partition β = ( β 1 , . . . , β k ) is b-bounded if β i ≤ b for all i . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 18 / 37

  62. Coxeter Groups Interpretations Application Future work Bounded partitions for � S n / S n A partition β = ( β 1 , . . . , β k ) is b-bounded if β i ≤ b for all i . Elements of � S n / S n are in bijection with ( n − 1)-bounded partitions. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 18 / 37

  63. Coxeter Groups Interpretations Application Future work Bounded partitions for � S n / S n A partition β = ( β 1 , . . . , β k ) is b-bounded if β i ≤ b for all i . Elements of � S n / S n are in bijection with ( n − 1)-bounded partitions. Bijection: (Lapointe, Morse, 2005) { n -cores λ } ↔ { ( n − 1)-bounded partitions β } Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 18 / 37

  64. Coxeter Groups Interpretations Application Future work Bounded partitions for � S n / S n A partition β = ( β 1 , . . . , β k ) is b-bounded if β i ≤ b for all i . Elements of � S n / S n are in bijection with ( n − 1)-bounded partitions. Bijection: (Lapointe, Morse, 2005) { n -cores λ } ↔ { ( n − 1)-bounded partitions β } ◮ Remove all boxes of λ with hook length ≥ n Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 18 / 37

  65. Coxeter Groups Interpretations Application Future work Bounded partitions for � S n / S n A partition β = ( β 1 , . . . , β k ) is b-bounded if β i ≤ b for all i . Elements of � S n / S n are in bijection with ( n − 1)-bounded partitions. Bijection: (Lapointe, Morse, 2005) { n -cores λ } ↔ { ( n − 1)-bounded partitions β } ◮ Remove all boxes of λ with hook length ≥ n ◮ Left-justify remaining boxes. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 18 / 37

  66. Coxeter Groups Interpretations Application Future work Bounded partitions for � S n / S n A partition β = ( β 1 , . . . , β k ) is b-bounded if β i ≤ b for all i . Elements of � S n / S n are in bijection with ( n − 1)-bounded partitions. Bijection: (Lapointe, Morse, 2005) { n -cores λ } ↔ { ( n − 1)-bounded partitions β } ◮ Remove all boxes of λ with hook length ≥ n ◮ Left-justify remaining boxes. 10 9 6 5 2 1 7 6 3 2 − → − → 6 5 2 1 3 2 2 1 λ = (6 , 4 , 4 , 2 , 2) β = (2 , 2 , 2 , 2 , 2) Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 18 / 37

  67. Coxeter Groups Interpretations Application Future work Canonical reduced expression for � S n / S n Given the bounded partition, read off the reduced expression: Method: (Berg, Jones, Vazirani, 2009) ◮ Fill β with residues i ◮ Tally s i reading right-to-left in rows from bottom-to-top Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 19 / 37

  68. Coxeter Groups Interpretations Application Future work Canonical reduced expression for � S n / S n Given the bounded partition, read off the reduced expression: Method: (Berg, Jones, Vazirani, 2009) ◮ Fill β with residues i ◮ Tally s i reading right-to-left in rows from bottom-to-top Example. [ − 4 , − 3 , 7 , 10] = s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 . � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 0 1 1 2 3 4 3 0 − → − → − → 5 6 7 8 2 3 9 10 11 12 1 2 13 14 15 16 0 1 17 18 19 20 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 19 / 37

  69. Coxeter Groups Interpretations Application Future work Canonical reduced expression for � S n / S n Given the bounded partition, read off the reduced expression: Method: (Berg, Jones, Vazirani, 2009) ◮ Fill β with residues i ◮ Tally s i reading right-to-left in rows from bottom-to-top Example. [ − 4 , − 3 , 7 , 10] = s 1 s 0 s 2 s 1 s 3 s 2 s 0 s 3 s 1 s 0 . � 7 � 6 � 5 � 4 � 3 � 2 � 1 0 0 1 1 2 3 4 3 0 − → − → − → 5 6 7 8 2 3 9 10 11 12 1 2 13 14 15 16 0 1 17 18 19 20 ◮ The Coxeter length of w is the number of boxes in β . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 19 / 37

  70. Coxeter Groups Interpretations Application Future work Fully commutative elements Definition. An element in a Coxeter group is fully commutative if it has only one reduced expression (up to commutation relations). NO BRAIDS ALLOWED! Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 20 / 37

  71. Coxeter Groups Interpretations Application Future work Fully commutative elements Definition. An element in a Coxeter group is fully commutative if it has only one reduced expression (up to commutation relations). NO BRAIDS ALLOWED! Example. In S 4 , s 1 s 2 s 3 s 1 is not fully commutative because OK BAD = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 s 1 s 2 s 3 s 1 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 20 / 37

  72. Coxeter Groups Interpretations Application Future work Fully commutative elements Definition. An element in a Coxeter group is fully commutative if it has only one reduced expression (up to commutation relations). NO BRAIDS ALLOWED! Example. In S 4 , s 1 s 2 s 3 s 1 is not fully commutative because OK BAD = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 s 1 s 2 s 3 s 1 Question: What is s 1 s 2 s 1 in 1-line notation? Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 20 / 37

  73. Coxeter Groups Interpretations Application Future work Fully commutative elements Definition. An element in a Coxeter group is fully commutative if it has only one reduced expression (up to commutation relations). NO BRAIDS ALLOWED! Example. In S 4 , s 1 s 2 s 3 s 1 is not fully commutative because OK BAD = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 s 1 s 2 s 3 s 1 Question: What is s 1 s 2 s 1 in 1-line notation? Answer: 1 2 3 4 5 6 . . . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 20 / 37

  74. Coxeter Groups Interpretations Application Future work Fully commutative elements Definition. An element in a Coxeter group is fully commutative if it has only one reduced expression (up to commutation relations). NO BRAIDS ALLOWED! Example. In S 4 , s 1 s 2 s 3 s 1 is not fully commutative because OK BAD = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 s 1 s 2 s 3 s 1 Question: What is s 1 s 2 s 1 in 1-line notation? Answer: 2 1 3 4 5 6 . . . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 20 / 37

  75. Coxeter Groups Interpretations Application Future work Fully commutative elements Definition. An element in a Coxeter group is fully commutative if it has only one reduced expression (up to commutation relations). NO BRAIDS ALLOWED! Example. In S 4 , s 1 s 2 s 3 s 1 is not fully commutative because OK BAD = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 s 1 s 2 s 3 s 1 Question: What is s 1 s 2 s 1 in 1-line notation? Answer: 2 3 1 4 5 6 . . . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 20 / 37

  76. Coxeter Groups Interpretations Application Future work Fully commutative elements Definition. An element in a Coxeter group is fully commutative if it has only one reduced expression (up to commutation relations). NO BRAIDS ALLOWED! Example. In S 4 , s 1 s 2 s 3 s 1 is not fully commutative because OK BAD = s 1 s 2 s 1 s 3 = s 2 s 1 s 2 s 3 s 1 s 2 s 3 s 1 Question: What is s 1 s 2 s 1 in 1-line notation? Answer: 3 2 1 4 5 6 . . . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 20 / 37

  77. Coxeter Groups Interpretations Application Future work Enumerating fully commutative elements Question: How many fully commutative elements are there in S n ? Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 21 / 37

  78. Coxeter Groups Interpretations Application Future work Enumerating fully commutative elements Question: How many fully commutative elements are there in S n ? Answer: Catalan many! S 1 : 1. id S 2 : 2. id, s 1 S 3 : 5. id, s 1 , s 2 , s 1 s 2 , s 2 s 1 S 4 : 14. id, s 1 , s 2 , s 3 , s 1 s 2 , s 2 s 1 , s 2 s 3 , s 3 s 2 , s 1 s 3 , s 1 s 2 s 3 , s 1 s 3 s 2 , s 2 s 1 s 3 , s 3 s 2 s 1 , s 2 s 1 s 3 s 2 Key idea: (Billey, Jockusch, Stanley, 1993) w is fully commutative ⇐ ⇒ w is 321-avoiding. (Knuth, 1973) These are counted by the Catalan numbers. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 21 / 37

  79. Coxeter Groups Interpretations Application Future work Enumerating fully commutative elements Question: How many fully commutative elements are there in � S n ? Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 22 / 37

  80. Coxeter Groups Interpretations Application Future work Enumerating fully commutative elements Question: How many fully commutative elements are there in � S n ? (Even in � Answer: Infinitely many! S 3 .) id , s 1 , s 1 s 2 , s 1 s 2 s 0 , s 1 s 2 s 0 s 1 , s 1 s 2 s 0 s 1 s 2 , . . . Multiplying the generators cyclically does not introduce braids. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 22 / 37

  81. Coxeter Groups Interpretations Application Future work Enumerating fully commutative elements Question: How many fully commutative elements are there in � S n ? (Even in � Answer: Infinitely many! S 3 .) id , s 1 , s 1 s 2 , s 1 s 2 s 0 , s 1 s 2 s 0 s 1 , s 1 s 2 s 0 s 1 s 2 , . . . Multiplying the generators cyclically does not introduce braids. This is not the right question. Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 22 / 37

  82. Coxeter Groups Interpretations Application Future work Enumerating fully commutative elements Question: How many fully commutative elements are there in � S n , with Coxeter length ℓ ? s 0 s 0 s 1 s 0 s 2 s 0 s 1 s 2 s 0 s 2 s 1 In � S 3 : id , , , , . . . s 1 s 1 s 0 s 1 s 2 s 1 s 0 s 2 s 1 s 2 s 0 s 2 s 2 s 0 s 2 s 1 s 2 s 0 s 1 s 2 s 1 s 0 Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 23 / 37

  83. Coxeter Groups Interpretations Application Future work Enumerating fully commutative elements Question: How many fully commutative elements are there in � S n , with Coxeter length ℓ ? s 0 s 0 s 1 s 0 s 2 s 0 s 1 s 2 s 0 s 2 s 1 In � S 3 : id , , , , . . . s 1 s 1 s 0 s 1 s 2 s 1 s 0 s 2 s 1 s 2 s 0 s 2 s 2 s 0 s 2 s 1 s 2 s 0 s 1 s 2 s 1 s 0 Question: Determine the coefficient of q ℓ in the generating function � q ℓ ( w ) . f n ( q ) = w ∈ f S FC e n f 3 ( q ) = 1 q 0 + 3 q 1 + 6 q 2 + 6 q 3 + . . . Combinatorial interpretations in affine Coxeter groups Binghamton University Combinatorics Seminar Christopher R. H. Hanusa Queens College, CUNY May 12, 2011 23 / 37

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Coxeter groups and Artin groups Day 4: Affine Isometries and Artin Groups Jon McCammond (U.C.

Coxeter groups and Artin groups Day 4: Affine Isometries and Artin Groups Jon McCammond (U.C.

Coxeter groups and Artin groups Day 4: Affine Isometries and Artin Groups Jon McCammond (U.C. Santa Barbara) 1 Factoring Motions into Reflections In this final talk, Id like to analyze all possible ways to factor a spherical or affine

239 views • 23 slides
permutation statistics in the affine Coxeter group of type A Eli Bagno Jerusalem College of

permutation statistics in the affine Coxeter group of type A Eli Bagno Jerusalem College of

The Coxeter affine group of type A An algorithm for the O.G.S. decomposition permutation statistics in the affine Coxeter group of type A Eli Bagno Jerusalem College of Technology Riccardo Biagioli University of Lyon 1 Robert Schwarz Bar

859 views • 63 slides
What do Coxeter Groups and Boolean Networks have in Common? Matthew Macauley Department of

What do Coxeter Groups and Boolean Networks have in Common? Matthew Macauley Department of

Graph dynamical systems Coxeter groups Interplay between Coxeter theory and SDSs Summary References What do Coxeter Groups and Boolean Networks have in Common? Matthew Macauley Department of Mathematical Sciences CLEMSON UNIVERSITY

390 views • 18 slides
Coxeter groups and Artin groups Day 1: Polytopes and Reflection Groups Jon McCammond (U.C. Santa

Coxeter groups and Artin groups Day 1: Polytopes and Reflection Groups Jon McCammond (U.C. Santa

Coxeter groups and Artin groups Day 1: Polytopes and Reflection Groups Jon McCammond (U.C. Santa Barbara) 1 Overview The plan is to spend two days on (topics related to) Coxeter groups, and two days on (topics related to) Artin groups.

728 views • 25 slides
Combinatorial interpretations for -vectors T. Kyle Petersen DePaul University joint with Eran

Combinatorial interpretations for -vectors T. Kyle Petersen DePaul University joint with Eran

Combinatorial interpretations for -vectors T. Kyle Petersen DePaul University joint with Eran Nevo (Cornell), arXiv:0909.0694 San Francisco, January, 2010 Combinatorial interpretations for -vectors Gals conjecture An example The

888 views • 69 slides
The shortest path poset of finite Coxeter Groups Sal A. Blanco Cornell University Fall

The shortest path poset of finite Coxeter Groups Sal A. Blanco Cornell University Fall

The shortest path poset of finite Coxeter Groups Sal A. Blanco Cornell University Fall Eastern Section Meeting of the AMS Penn State, October 2425 Coxeter Groups Groups with presentation S | ( ss ) m ( s , s ) = e , for all s

340 views • 18 slides
Reduced words in Coxeter Groups Philippe Nadeau (CNRS & Univ. Lyon 1) MADACA conference,

Reduced words in Coxeter Groups Philippe Nadeau (CNRS & Univ. Lyon 1) MADACA conference,

Reduced words in Coxeter Groups Philippe Nadeau (CNRS & Univ. Lyon 1) MADACA conference, June 21 2016 Introduction Coxeter groups are ubiquitous structures in mathematics, which can be thought of as generalized reflection groups. They are

783 views • 38 slides
Coxeter groups and Artin groups Day 2: Symmetric Spaces and Simple Groups Jon McCammond (U.C.

Coxeter groups and Artin groups Day 2: Symmetric Spaces and Simple Groups Jon McCammond (U.C.

Coxeter groups and Artin groups Day 2: Symmetric Spaces and Simple Groups Jon McCammond (U.C. Santa Barbara) 1 Symmetric Spaces Def: A Riemannian manifold is called a symmetric space if at each point p there exists an isometry fixing p and

295 views • 25 slides
The 6-transposition quotients of the Coxeter groups G ( m , n , p ) Sophie Decelle Imperial

The 6-transposition quotients of the Coxeter groups G ( m , n , p ) Sophie Decelle Imperial

The 6-transposition quotients of the Coxeter groups G ( m , n , p ) Sophie Decelle Imperial College London Groups St Andrews 2013 () 1 / 26 Outline Introduction 1 Property ( ) Motivation 2 Majorana representation Dihedral subalgebras

845 views • 81 slides
Fully Commutative Elements in Coxeter Groups Philippe Nadeau (CNRS & Universit e Lyon 1)

Fully Commutative Elements in Coxeter Groups Philippe Nadeau (CNRS & Universit e Lyon 1)

Fully Commutative Elements in Coxeter Groups Philippe Nadeau (CNRS & Universit e Lyon 1) Jiao Tong University, Shanghai, October 29th Organization I. Coxeter groups II. Fully commutative elements and Heaps III. FC elements in type A

803 views • 65 slides
Graph Dynamical Systems and Coxeter Groups Matthew Macauley Department of Mathematical Sciences

Graph Dynamical Systems and Coxeter Groups Matthew Macauley Department of Mathematical Sciences

Acyclic Orientations Sequential Dynamical Systems Coxeter Groups Summary References Graph Dynamical Systems and Coxeter Groups Matthew Macauley Department of Mathematical Sciences Clemson University ADM Seminar Clemson University January

924 views • 53 slides
Deflation in Coxeter Groups G Eric Moorhouse based on recent work (1993-present) of John H.

Deflation in Coxeter Groups G Eric Moorhouse based on recent work (1993-present) of John H.

Deflation in Coxeter Groups G Eric Moorhouse based on recent work (1993-present) of John H. Conway and Christopher S. Simons The cube defines an infinite Coxeter group. The cube has four 6-cycles (as induced subgraphs). ~ Deflate every A 5

751 views • 24 slides
Non-crossing partitions for arbitrary Coxeter groups 1 2 4 3 Jon McCammond U.C. Santa

Non-crossing partitions for arbitrary Coxeter groups 1 2 4 3 Jon McCammond U.C. Santa

Non-crossing partitions for arbitrary Coxeter groups 1 2 4 3 Jon McCammond U.C. Santa Barbara (Joint work with Noel Brady, John Crisp, and Anton Kaul) 1 Outline I. Posets and Garside structures II. Examples and consequences III.

418 views • 31 slides
Witt groups and Witt spaces 1. Geometric interpretations of the Witt groups W ( Z ) and W ( Q )

Witt groups and Witt spaces 1. Geometric interpretations of the Witt groups W ( Z ) and W ( Q )

Witt groups and Witt spaces 1. Geometric interpretations of the Witt groups W ( Z ) and W ( Q ) 2. Witt space bordism and BalmerWitt groups of PL-constructible sheaves 3. Witt bordism proof of CappellShanesons L-class formula 4.

201 views • 17 slides
Word posets, with applications to Coxeter groups Matthew J. Samuel Rutgers UniversityNew

Word posets, with applications to Coxeter groups Matthew J. Samuel Rutgers UniversityNew

Word posets, with applications to Coxeter groups Matthew J. Samuel Rutgers UniversityNew Brunswick WORDS 2011 Matthew J. Samuel Word posets, with applications to Coxeter groups Introduction Word posets are partially ordered sets that

563 views • 23 slides
Coxeter groups and palindromic Poincar e polynomials Edward Richmond (joint work with W.

Coxeter groups and palindromic Poincar e polynomials Edward Richmond (joint work with W.

Coxeter groups and palindromic Poincar e polynomials Edward Richmond (joint work with W. Slofstra) University of British Columbia January 10, 2013 Slofstra-Richmond* (UBC) Coxeter groups and Poincar e polynomials January 10, 2013 1 / 1

241 views • 13 slides
Short generators without quantum computers: the case of multiquadratics Christine van Vredendaal

Short generators without quantum computers: the case of multiquadratics Christine van Vredendaal

Short generators without quantum computers: the case of multiquadratics Christine van Vredendaal Technische Universiteit Eindhoven 1 May 2017 Joint work with: Jens Bauch & Daniel J. Bernstein & Henry de Valence & Tanja Lange

461 views • 44 slides
O PTGEN : A Generator for Local Optimizations Sebastian Buchwald Institute for Program Structures

O PTGEN : A Generator for Local Optimizations Sebastian Buchwald Institute for Program Structures

TRR 89 O PTGEN : A Generator for Local Optimizations Sebastian Buchwald Institute for Program Structures and Data Organization, Karlsruhe Institute of Technology (KIT) 1 April 17, 2015 Sebastian Buchwald O PTGEN : A Generator for Local

373 views • 35 slides
GEMM-Like Operations Applications Richard Michael Veras Platforms Carnegie Mellon Want

GEMM-Like Operations Applications Richard Michael Veras Platforms Carnegie Mellon Want

Carnegie Mellon Performance An Algorithmic Specific Code Generator for GEMM-Like Operations Applications Richard Michael Veras Platforms Carnegie Mellon Want Automatic High Performance Model Driven GEMM-Like approach for Operations

318 views • 17 slides
Overview of Monte Carlo Generators John Campbell, Fermilab Monte Carlo overview: history

Overview of Monte Carlo Generators John Campbell, Fermilab Monte Carlo overview: history

Overview of Monte Carlo Generators John Campbell, Fermilab Monte Carlo overview: history Theoretical description of a sample of events recorded by an experiment. Distinction between: flexible event generators that provide an

565 views • 30 slides
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas Dean Doron 1 Pooya

Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas Dean Doron 1 Pooya

Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas Dean Doron 1 Pooya Hatami 2 William M. Hoza 3 UT Austin Stanford UT Austin Ohio State UT Austin July 19 CCC 2019 1Supported by NSF Grant CCF-1705028 2Supported

1.08k views • 105 slides
Generating Structured Test Data with Specific Properties using Metaheuristic and Nested

Generating Structured Test Data with Specific Properties using Metaheuristic and Nested

Generating Structured Test Data with Specific Properties using Metaheuristic and Nested Monte-Carlo Search Simon Poulding Blekinge Institute of Technology Robert Feldt Chalmers University Context software testing: generating test data for

594 views • 34 slides
1 File Management: Outline File Management File Package Overview The GATFile class Authors

1 File Management: Outline File Management File Package Overview The GATFile class Authors

What is GAT? Grid Application Toolkit GAT is? an API and toolkit for developing and running portable grid apps independently of the underlying grid infrastructure and available services Authors: Gabrielle Allen, K. Davis, T. Goodale,

194 views • 5 slides
Informational Webinar NATIONAL CENTER FOR IMPROVING TEACHER AND LEADER PERFORMANCE TO BETTER

Informational Webinar NATIONAL CENTER FOR IMPROVING TEACHER AND LEADER PERFORMANCE TO BETTER

Informational Webinar NATIONAL CENTER FOR IMPROVING TEACHER AND LEADER PERFORMANCE TO BETTER SERVE CHILDREN WITH DISABILITIES CFDA 84.325A Office of Special Education Programs U.S. Department of Education June 2, 2017 11:00 AM EDT

867 views • 51 slides

More recommend