Standard Young Tableaux Old and New

Transcription

1 Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct

2 David Chillag

3 Abstract More than a hundred years ago, Frobenius and Young based the emerging representation theory of the symmetric group on the combinatorial objects now called Standard Young Tableaux (SYT). Many important features of these classical objects have since been discovered, including some surprising interpretations and the celebrated hook length formula for their number. In recent years, SYT of non-classical shapes have come up in research and were shown to have, in many cases, surprisingly nice enumeration formulas. The talk will present some gems from the study of SYT over the years, based on a recent survey paper. No prior acquaintance assumed.

4 Founders

5 Founders A. Young

6 Founders A. Young F. G. Frobenius

7 Founders A. Young F. G. Frobenius P. A. MacMahon

8 Classical

9 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides.

10 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides. 1

11 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides. 2 1

12 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides

13 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides

14 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides

15 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides Rotate:

16 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides Rotate:

17 Introduction Consider throwing balls labeled 1, 2,..., n into a V-shaped bin with perpendicular sides Rotate:

18 Diagrams and Tableaux

19 Diagrams and Tableaux partition diagram/shape λ = (4, 3, 1) 8 [λ] =

20 Diagrams and Tableaux partition diagram/shape λ = (4, 3, 1) 8 [λ] = Standard Young Tableau (SYT): T = SYT(4, 3, 1). Entries increase along rows and columns

21 Conventions English Russian French

22 Number of SYT

23 Number of SYT f λ = # SYT(λ)

24 Number of SYT f λ = # SYT(λ)

25 Number of SYT f λ = # SYT(λ) λ = (3, 2), f λ = 5

26 SYT and S n Representations S n = the symmetric group on n letters

27 SYT and S n Representations S n = the symmetric group on n letters λ χ λ partition of n irreducible character of S n

28 SYT and S n Representations S n = the symmetric group on n letters λ χ λ partition of n irreducible character of S n SYT(λ) basis of representation space

29 SYT and S n Representations S n = the symmetric group on n letters λ χ λ partition of n irreducible character of S n SYT(λ) basis of representation space f λ = χ λ (id)

30 SYT and S n Representations S n = the symmetric group on n letters λ χ λ partition of n irreducible character of S n SYT(λ) basis of representation space f λ = χ λ (id) Corollary: (f λ ) 2 = n! λ n

31 [Robinson, Schensted (, Knuth)] RS(K) Correspondence

32 [Robinson, Schensted (, Knuth)] RS(K) Correspondence π (P, Q) permutation pair of SYT of the same shape

33 [Robinson, Schensted (, Knuth)] RS(K) Correspondence π (P, Q) permutation pair of SYT of the same shape ,

34 [Robinson, Schensted (, Knuth)] RS(K) Correspondence π (P, Q) permutation pair of SYT of the same shape , Corollary: (f λ ) 2 = n! λ n

35 Interpretation: The Young Lattice A SYT describes a growth process of diagrams.

36 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process

37 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process

38 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process

39 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process

40 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process

41 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process The Young lattice consists of all partitions (diagrams), of all sizes, ordered by inclusion.

42 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process The Young lattice consists of all partitions (diagrams), of all sizes, ordered by inclusion. SYT(λ) maximal chains in the Young lattice from to λ

43 Interpretation: The Young Lattice A SYT describes a growth process of diagrams. For example, corresponds to the process The Young lattice consists of all partitions (diagrams), of all sizes, ordered by inclusion. SYT(λ) maximal chains in the Young lattice from to λ The number of such maximal chains is therefore f λ.

44 Interpretation: Lattice Paths Each SYT of shape λ = (λ 1,..., λ t ) corresponds to a lattice path in R t, from the origin 0 to the point λ, where in each step exactly one of the coordinates changes (by adding 1), while staying within the region {(x 1,..., x t ) R t x 1... x t 0}.

45 Interpretation: Lattice Paths Each SYT of shape λ = (λ 1,..., λ t ) corresponds to a lattice path in R t, from the origin 0 to the point λ, where in each step exactly one of the coordinates changes (by adding 1), while staying within the region {(x 1,..., x t ) R t x 1... x t 0}. x 2 x 1

46 Interpretation: Lattice Paths Each SYT of shape λ = (λ 1,..., λ t ) corresponds to a lattice path in R t, from the origin 0 to the point λ, where in each step exactly one of the coordinates changes (by adding 1), while staying within the region {(x 1,..., x t ) R t x 1... x t 0}. x 2 1 x 1

47 Interpretation: Lattice Paths Each SYT of shape λ = (λ 1,..., λ t ) corresponds to a lattice path in R t, from the origin 0 to the point λ, where in each step exactly one of the coordinates changes (by adding 1), while staying within the region {(x 1,..., x t ) R t x 1... x t 0}. x x 1

48 Interpretation: Lattice Paths Each SYT of shape λ = (λ 1,..., λ t ) corresponds to a lattice path in R t, from the origin 0 to the point λ, where in each step exactly one of the coordinates changes (by adding 1), while staying within the region {(x 1,..., x t ) R t x 1... x t 0}. x 2 x

49 Interpretation: Lattice Paths Each SYT of shape λ = (λ 1,..., λ t ) corresponds to a lattice path in R t, from the origin 0 to the point λ, where in each step exactly one of the coordinates changes (by adding 1), while staying within the region {(x 1,..., x t ) R t x 1... x t 0}. x 2 x

50 Interpretation: Lattice Paths Each SYT of shape λ = (λ 1,..., λ t ) corresponds to a lattice path in R t, from the origin 0 to the point λ, where in each step exactly one of the coordinates changes (by adding 1), while staying within the region {(x 1,..., x t ) R t x 1... x t 0}. x 2 λ = (3, 2) 1 2 x

51 Interpretation: Order Polytope The order polytope corresponding to a diagram D is P(D) := {f : D [0, 1] c D c = f (c) f (c ) ( c, c D)}, where D is the natural partial order between the cells of D. It is a closed convex subset of the unit cube [0, 1] D.

52 Interpretation: Order Polytope The order polytope corresponding to a diagram D is P(D) := {f : D [0, 1] c D c = f (c) f (c ) ( c, c D)}, where D is the natural partial order between the cells of D. It is a closed convex subset of the unit cube [0, 1] D. a b c d e

53 Interpretation: Order Polytope The order polytope corresponding to a diagram D is P(D) := {f : D [0, 1] c D c = f (c) f (c ) ( c, c D)}, where D is the natural partial order between the cells of D. It is a closed convex subset of the unit cube [0, 1] D. a b c d e f : {a, b, c, d, e} [0, 1] f (a) f (b) f (c) f (d) f (e) f (a) f (d) f (b) f (e)

54 Interpretation: Order Polytope The order polytope corresponding to a diagram D is P(D) := {f : D [0, 1] c D c = f (c) f (c ) ( c, c D)}, where D is the natural partial order between the cells of D. It is a closed convex subset of the unit cube [0, 1] D. Observation: a b c d e f : {a, b, c, d, e} [0, 1] f (a) f (b) f (c) f (d) f (e) f (a) f (d) f (b) f (e) vol P(D) = f D D!.

55 Interpretation: Reduced Words (1) The following theorem was conjectured and first proved by Stanley using symmetric functions. A bijective proof was given later by Edelman and Greene. Theorem: [Stanley 1984, Edelman-Green 1987] The number of reduced words (in adjacent transpositions) of the longest permutation w 0 := [n, n 1,..., 1] in S n is equal to the number of SYT of staircase shape δ n 1 = (n 1, n 2,..., 1).

56 Interpretation: Reduced Words (2) An analogue for type B was conjectured by Stanley and proved by Haiman. Theorem: [Haiman 1989] The number of reduced words (in the alphabet of Coxeter generators) of the longest element w 0 := [ 1, 2,..., n] in B n is equal to the number of SYT of square n n shape.

57 Product and Determinantal Formulas For a partition λ = (λ 1,..., λ t ), let l i := λ i + t i (1 i t).

58 Product and Determinantal Formulas For a partition λ = (λ 1,..., λ t ), let l i := λ i + t i (1 i t). Theorem: [Frobenius 1900, MacMahon 1909, Young 1927] f λ = λ! t i=1 l i! (i,j): i<j (l i l j ).

59 Product and Determinantal Formulas For a partition λ = (λ 1,..., λ t ), let l i := λ i + t i (1 i t). Theorem: [Frobenius 1900, MacMahon 1909, Young 1927] f λ = λ! t i=1 l i! Theorem (Determinantal Formula) (i,j): i<j (l i l j ). [ f λ 1 = λ! det (λ i i + j)! ] t, i,j=1 using the convention 1/k! := 0 for negative integers k.

60 Hook Length Formula The hook length of a cell c = (i, j) in a diagram of shape λ is h c := λ i + λ j i j + 1.

61 Hook Length Formula The hook length of a cell c = (i, j) in a diagram of shape λ is h c := λ i + λ j i j + 1. hook of c = (1, 2) hook lengths

62 Hook Length Formula The hook length of a cell c = (i, j) in a diagram of shape λ is h c := λ i + λ j i j + 1. hook of c = (1, 2) hook lengths Theorem: [Frame-Robinson-Thrall, 1954] f λ = λ! c [λ] h. c

63 Still Classical

64 Skew Shapes If λ and µ are partitions such that [µ] [λ], namely µ i λ i ( i), then the skew diagram of shape λ/µ is the set difference [λ/µ] := [λ] \ [µ] of the two ordinary shapes. = [(6, 4, 3, 1)/(4, 2, 1)] SYT((6, 4, 3, 1)/(4, 2, 1)).

65 Skew Shapes and Representations

66 Skew Shapes and Representations λ/µ χ λ/µ skew shape of size n (reducible) character of S n

67 Skew Shapes and Representations λ/µ χ λ/µ skew shape of size n (reducible) character of S n SYT(λ/µ) basis of representation space

68 Skew Shapes and Representations λ/µ χ λ/µ skew shape of size n (reducible) character of S n SYT(λ/µ) basis of representation space f λ/µ = χ λ/µ (id)

69 Skew Shapes and Representations λ/µ χ λ/µ skew shape of size n (reducible) character of S n SYT(λ/µ) basis of representation space f λ/µ = χ λ/µ (id) For example, the regular character χ reg (g) = G δ g,id (G = S 4 )

70 Skew Determinantal Formula Let λ = (λ 1,..., λ t ) and µ = (µ 1,..., µ s ) be partitions such that µ i λ i ( i). Theorem [Aitken 1943, Feit 1953] [ f λ/µ 1 = λ/µ! det (λ i µ j i + j)! ] t, i,j=1 with the conventions µ j := 0 for j > s and 1/k! := 0 for negative integers k. Unfortunately, no product or hook length formula is known for general skew shapes.

71 Shifted Shapes A partition λ = (λ 1,..., λ t ) is strict if the part sizes λ i are strictly decreasing: λ 1 >... > λ t > 0.

72 Shifted Shapes A partition λ = (λ 1,..., λ t ) is strict if the part sizes λ i are strictly decreasing: λ 1 >... > λ t > 0. The shifted diagram of shape λ is the set D = [λ ] := {(i, j) 1 i t, i j λ i + i 1}. Note that (λ i + i 1) t i=1 are weakly decreasing.

73 Shifted Shapes A partition λ = (λ 1,..., λ t ) is strict if the part sizes λ i are strictly decreasing: λ 1 >... > λ t > 0. The shifted diagram of shape λ is the set D = [λ ] := {(i, j) 1 i t, i j λ i + i 1}. Note that (λ i + i 1) t i=1 are weakly decreasing. λ = (4, 3, 1) = [λ ] =

74 Shifted Shapes A partition λ = (λ 1,..., λ t ) is strict if the part sizes λ i are strictly decreasing: λ 1 >... > λ t > 0. The shifted diagram of shape λ is the set D = [λ ] := {(i, j) 1 i t, i j λ i + i 1}. Note that (λ i + i 1) t i=1 are weakly decreasing. λ = (4, 3, 1) = [λ ] = T = SYT((4, 3, 1) ).

75 Shifted Shapes and Representations

76 Shifted Shapes and Representations Strict partitions λ of n essentially correspond to irreducible projective characters of S n.

77 Shifted Shapes and Representations Strict partitions λ of n essentially correspond to irreducible projective characters of S n. g λ := # SYT(λ ) Corollary: 2 n t (g λ ) 2 = n! λ =n

78 Shifted Formulas Like ordinary shapes, the number g λ of SYT of shifted shape λ has three types of formulas product, hook length and determinantal. Theorem [Schur 1911, Thrall 1952] Theorem Theorem g λ = g λ = λ! t i=1 λ i! g λ = (i,j): i<j λ! c [λ ] h c λ i λ j λ i + λ j [ λ! (i,j): i<j (λ i + λ j ) det 1 (λ i t + j)! ] t i,j=1

79 Non-Classical

80 Truncated Shapes

81 Truncated Shapes classical non-classical

82 Truncated Shapes classical skew non-classical shifted, truncated

83 Truncated Shapes classical skew non-classical shifted, truncated # SYT = 768 # SYT = 4

84 Truncated Shifted Staircase The number of SYT whose shape is a shifted staircase with a truncated corner came up in a combinatorial setting, counting the number of shortest paths between antipodes in a certain graph of triangulations.

85 Truncated Shifted Staircase The number of SYT whose shape is a shifted staircase with a truncated corner came up in a combinatorial setting, counting the number of shortest paths between antipodes in a certain graph of triangulations. Computations show that # SYT is unusually smooth.

86 Truncated Shifted Staircase The number of SYT whose shape is a shifted staircase with a truncated corner came up in a combinatorial setting, counting the number of shortest paths between antipodes in a certain graph of triangulations. Computations show that # SYT is unusually smooth. λ = (9, 9, 8, 7, 6, 5, 4, 3, 2, 1) N = 54 (size)

87 Truncated Shifted Staircase The number of SYT whose shape is a shifted staircase with a truncated corner came up in a combinatorial setting, counting the number of shortest paths between antipodes in a certain graph of triangulations. Computations show that # SYT is unusually smooth. λ = (9, 9, 8, 7, 6, 5, 4, 3, 2, 1) N = 54 (size) g λ = = The largest prime factor is < N!!!

88 Shifted Staircase Let δ n := (n, n 1,..., 1), a strict partition (shifted staircase shape).

89 Shifted Staircase Let δ n := (n, n 1,..., 1), a strict partition (shifted staircase shape). Corollary: (of Schur s product formula for shifted shapes) The number of SYT of shifted staircase shape δ n is where N := δ n = ( ) n+1 2. n 1 i! g δn = N! (2i + 1)!, i=0

90 Truncated Shifted Staircase The following enumeration problem was actually the original motivation for the study of truncated shapes, because of its combinatorial interpretation.

91 Truncated Shifted Staircase The following enumeration problem was actually the original motivation for the study of truncated shapes, because of its combinatorial interpretation. Theorem: [A-King-Roichman, Panova] The number of SYT of truncated shifted staircase shape δ n \ (1) is equal to g δn C nc n 2 2 C 2n 3, where C n = 1 n+1( 2n n ) is the n-th Catalan number.

92 Truncated Shifted Staircase More generally, truncating a square from a shifted staircase shape: [δ 5 \ (2 2 )] = Theorem: [AKR] The number of SYT of truncated shifted staircase shape δ m+2k \ ((k 1) k 1 ) is g (m+k+1,...,m+3,m+1,...,1) g (m+k+1,...,m+3,m+1) N!M! (N M 1)!(2M + 1)!, where N = ( ) m+2k+1 2 (k 1) 2 is the size of the shape and M = k(2m + k + 3)/2 1. Similarly for truncating almost squares (k k 1, k 1).

93 Rectangle [(5 4 )] = Observation: The number of SYT of rectangular shape (n m ) is f (nm) = (mn)! FmF n F m+n, where F m := m 1 i=0 i!.

94 Truncated Rectangle Truncate a square from the NE corner of a rectangle: [(5 4 ) \ (2 2 )] = Theorem: [AKR] The number of SYT of truncated rectangular shape ((n + k 1) m+k 1 ) \ ((k 1) k 1 ) (and size N) is N!(mk 1)!(nk 1)!(m + n 1)!k (mk + nk 1)! Fm 1F n 1 F k 1 F m+n+k 1. Similar results were obtained for truncation by almost squares.

95 Truncated Rectangle Not much is known for truncation of rectangles by rectangles. The following formula was conjectured by AKR and proved by Sun. Theorem: [Sun] For n 2 f (nn )\(2) = (n2 2)!(3n 4)! 2 6 (6n 8)!(2n 2)!(n 2)! 2 F 2 n 2 F 2n 4. Theorem: [Snow] For n 2 and k 0 f (nk+1 )\(n 2) = (kn k)!(kn + n)! (kn + n k)! FkF n F n+k.

96 Truncated Rectangle Truncate a rectangle by a (shifted) staircase. [(4 5 ) \ δ 2 ] = Theorem: [Panova] Let m n k be positive integers. The number of SYT of truncated shape (n m ) \ δ k is ( ) N f (n k 1)m (m,m 1,...,m k) E(k + 1, m, n k 1) g, m(n k 1) E(k + 1, m, 0) where N = mn ( ) k+1 2 is the size of the shape and E(r, p, s) =....

97 Shifted Strip

98 Shifted Strip Theorem: [Sun] The number of SYT of truncated shifted shape with n rows and 4 cells in each row is the (2n 1)-st Pell number ( (1 + 2) 2n 1 (1 2) 2n 1).

99 Open Problems Which non-classical shapes have nice/product formulas? A modified hook length formula? A representation theoretical interpretation?

100 Grazie per l attenzione!