A003870 -id:A003870 - cp's OEIS frontend

A060240 Triangle T(n,k) in which n-th row gives degrees of irreducible representations of symmetric group S_n.

1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 3, 1, 1, 4, 4, 5, 5, 6, 1, 1, 5, 5, 5, 5, 9, 9, 10, 10, 16, 1, 1, 6, 6, 14, 14, 14, 14, 15, 15, 20, 21, 21, 35, 35, 1, 1, 7, 7, 14, 14, 20, 20, 21, 21, 28, 28, 35, 35, 42, 56, 56, 64, 64, 70, 70, 90, 1, 1, 8, 8, 27, 27, 28, 28, 42, 42, 42, 48, 48, 56, 56, 70, 84

Offset: 0

N. J. A. Sloane, Mar 21 2001

Sum_{k>=1} T(n,k)^2 = n!. - R. J. Mathar, May 09 2013
From Emeric Deutsch, Oct 31 2014: (Start)
Number of entries in row n = A000041(n) = number of partitions of n.
Sum of entries in row n = A000085(n).
Largest (= last) entry in row n = A003040(n).
The entries in row n give the number of standard Young tableaux of the Ferrers diagrams of the partitions of n (nondecreasingly). (End)

			Triangle begins:
  1;
  1;
  1, 1;
  1, 1, 2;
  1, 1, 2, 3, 3;
  1, 1, 4, 4, 5, 5, 6;
  ...

J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, ATLAS of Finite Groups, Oxford Univ. Press, 1985.
B. E. Sagan, The Symmetric Group, 2nd ed., Springer, 2001, New York.

Alois P. Heinz, Rows n = 0..36, flattened
J. S. Frame, G. de B. Robinson, and R. M. Thrall, The hook graphs of the symmetric group Canad. J. Math, 6:316-324, 1954. See Theorem 1, p. 318.
Index entries for sequences related to groups

Rows give A003870, A003871, etc. Cf. A060241, A060246, A060247.
Maximal entry in each row gives A003040.
Cf. A000041, A000085, A000142, A060437, A093784, A224653.

CharacterTable(SymmetricGroup(6)); // (say)

h:= proc(l) local n; n:= nops(l); add(i, i=l)!/mul(mul(1+l[i]-j+
      add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n) end:
g:= (n, i, l)-> `if`(n=0 or i=1, h([l[], 1$n]), `if`(i<1, 0,
                 seq(g(n-i*j, i-1, [l[], i$j]), j=0..n/i))):
T:= n-> sort([g(n, n, [])])[]:
seq(T(n), n=0..10);  # Alois P. Heinz, Jan 07 2013

h[l_List] := With[{n = Length[l]}, Total[l]!/Product[Product[1+l[[i]]-j + Sum[If[l[[k]] >= j, 1, 0], {k, i+1, n}], {j, 1, l[[i]]}], {i, 1, n}]];
g[n_, i_, l_List] := If[n == 0 || i == 1, h[Join[l, Array[1&, n]]], If[i<1, 0, Flatten @ Table[g[n-i*j, i-1, Join[l, Array[i&, j]]], {j, 0, n/i}]]];
T[n_] := Sort[g[n, n, {}]]; T[1] = {1};
Table[T[n], {n, 1, 10}] // Flatten (* Jean-François Alcover, Jan 27 2014, after Alois P. Heinz *)

More terms from Vladeta Jovovic, May 20 2003

A003040 Highest degree of an irreducible representation of symmetric group S_n of degree n.

Original entry on oeis.org

1, 1, 2, 3, 6, 16, 35, 90, 216, 768, 2310, 7700, 21450, 69498, 292864, 1153152, 4873050, 16336320, 64664600, 249420600, 1118939184, 5462865408, 28542158568, 117487079424, 547591590000, 2474843571200, 12760912164000, 57424104738000, 295284192952320

Offset: 1

N. J. A. Sloane and Richard Stanley

nonn

Highest number of standard tableaux of the Ferrers diagrams of the partitions of n. Example: a(4) = 3 because to the partitions 4, 31, 22, 211, and 1111 there correspond 1, 3, 2, 3, and 1 standard tableaux, respectively. - Emeric Deutsch, Oct 02 2015

			a(5) = 6 because the degrees for S_5 are 1,1,4,4,5,5,6.

J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, ATLAS of Finite Groups. Oxford Univ. Press, 1985 [for best online version see https://oeis.org/wiki/Welcome#Links_to_Other_Sites].
D. E. Littlewood, The Theory of Group Characters and Matrix Representations of Groups. 2nd ed., Oxford University Press, 1950, p. 265.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vasilii Duzhin, Table of n, a(n) for n = 1..153 (terms up to a(80) from Eric M. Schmidt)
S. Comét, Improved methods to calculate the characters of the symmetric group, Math. Comp. 14 (1960) 104-117.
J. McKay, The largest degrees of irreducible characters of the symmetric group. Math. Comp. 30 (1976), no. 135, 624-631. (Gives first 75 terms.)
J. McKay, Page 1 of 5 pages of tables from Math. Comp. paper [reports 29th term incorrectly]
J. McKay, Page 2 of 5 pages of tables from Math. Comp. paper
J. McKay, Page 3 of 5 pages of tables from Math. Comp. paper
J. McKay, Page 4 of 5 pages of tables from Math. Comp. paper
J. McKay, Page 5 of 5 pages of tables from Math. Comp. paper
Igor Pak, Greta Panova, and Damir Yeliussizov, On the largest Kronecker and Littlewood-Richardson coefficients, arXiv:1804.04693 [math.CO], 2018.
R. P. Stanley, Letter to N. J. A. Sloane, c. 1991

A117500 gives the corresponding partitions of n.

Cf. A003869, A003870, A003871, A003872, A003873, A003874, A003875, A003876, A003877.

h[l_] := With[{n = Length[l]}, Total[l]!/Product[Product[1 + l[[i]] - j + Sum[If[l[[k]] >= j, 1, 0], {k, i + 1, n}], {j, 1, l[[i]]}], {i, 1, n}]];
g[n_, i_, l_] := If[n == 0 || i == 1, h[Join[l, Array[1 &, n]]], If[i < 1, 0, Flatten@ Table[g[n - i*j, i - 1, Join[l, Array[i&, j]]], {j, 0, n/i}]]];
a[n_] := a[n] = g[n, n, {}] // Max;
Table[Print[n, " ", a[n]]; a[n], {n, 1, 50}] (* Jean-François Alcover, Sep 23 2024, after Alois P. Heinz in A060240 *)

def A003040(n):
    res = 1
    for P in Partitions(n):
        res = max(res, P.dimension())
    return res
# Eric M. Schmidt, May 07 2013

Entry revised and extended by N. J. A. Sloane, Apr 28 2006

a(29) corrected by Eric M. Schmidt, May 07 2013

A003869 Degrees of irreducible representations of symmetric group S_5.

Original entry on oeis.org

1, 1, 4, 4, 5, 5, 6

Offset: 1

N. J. A. Sloane

All 7 terms of this finite sequence are shown.

J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, ATLAS of Finite Groups. Oxford Univ. Press, 1985 [for best online version see https://oeis.org/wiki/Welcome#Links_to_Other_Sites].

Row n=5 of A060240.

Cf. A003870, A003871, A003872, A003873.

A003869 := List(Irr(CharacterTable("S5")), chi->chi[1]);; Sort(A003869); # Eric M. Schmidt, Jul 18 2012

Magma
```
// See A003875 for Magma code
```

h[l_] := With[{n = Length[l]}, Total[l]!/Product[Product[1 + l[[i]] - j + Sum[If[l[[k]] >= j, 1, 0], {k, i + 1, n}], {j, 1, l[[i]]}], {i, 1, n}]];
g[n_, i_, l_] := If[n == 0 || i == 1, h[Join[l, Array[1&, n]]], If[i < 1, 0, Flatten@ Table[g[n - i*j, i - 1, Join[l, Array[i &, j]]], {j, 0, n/i}]]];
T[n_] := g[n, n, {}];
Sort[T[5]] (* Jean-François Alcover, Sep 22 2024, after Alois P. Heinz in A060240 *)

A104707 Triangle read by rows distributing the 1602 multinomials described by A005651(6) related to Young tableau and Kostka numbers.

Original entry on oeis.org

1, 25, 1, 81, 20, 1, 25, 54, 15, 1, 100, 15, 36, 15, 1, 256, 60, 10, 27, 10, 1, 25, 128, 30, 5, 27, 10, 1, 100, 10, 64, 30, 5, 18, 10, 1, 81, 40, 5, 32, 10, 5, 9, 5, 1, 25, 27, 10, 0, 32, 10, 0, 9, 5, 1, 1, 5, 9, 10, 5, 16, 10, 5, 9, 5, 1

Offset: 1

Alford Arnold, Mar 19 2005

The last row (and the square roots of the first column) is 1 5 9 5 10 16 5 10 9 5 1, which when sorted appears as 1 1 5 5 5 5 9 9 10 10 16 in A003870 and A060240. The 1602 cases are distributed in A036038: 1 6 15 20 30 60 90 120 180 360 720.

			The triangle is:
1;
25,   1;
81,  20,  1;
25,  54, 15,  1;
100, 15, 36, 15,  1;
256, 60, 10, 27, 10,  1;
25, 128, 30,  5, 27, 10,  1;
100, 10, 64, 30,  5, 18, 10, 1;
81,  40,  5, 32, 10,  5,  9, 5, 1;
25,  27, 10,  0, 32, 10,  0, 9, 5, 1;
1,    5,  9, 10,  5, 16, 10, 5, 9, 5, 1;

D. Stanton and D. White, Constructive Combinatorics, 1986, page 83.

Cf. A000041, A000085, A000142, A003870, A060240, A005651, A036038 and A097522 (a similar triangle distributing the 246 multinomials in A005651(5)).

Cf. A104778.

A093764 Hook products of all partitions of 6.

Original entry on oeis.org

45, 72, 72, 80, 80, 144, 144, 144, 144, 720, 720

Offset: 1

Emeric Deutsch, May 17 2004

Row n=6 of A093784.

Cf. A003870, A060240.

H:=proc(pa) local F,j,p,Q,i,col,a,A: F:=proc(x) local i, ct: ct:=0: for i from 1 to nops(x) do if x[i]>1 then ct:=ct+1 else fi od: ct; end: for j from 1 to nops(pa) do p[1][j]:=pa[j] od: Q[1]:=[seq(p[1][j],j=1..nops(pa))]: for i from 2 to pa[1] do for j from 1 to F(Q[i-1]) do p[i][j]:=Q[i-1][j]-1 od: Q[i]:=[seq(p[i][j],j=1..F(Q[i-1]))] od: for i from 1 to pa[1] do col[i]:=[seq(Q[i][j]+nops(Q[i])-j,j=1..nops(Q[i]))] od: a:=proc(i,j) if i<=nops(Q[j]) and j<=pa[1] then Q[j][i]+nops(Q[j])-i else 1 fi end: A:=matrix(nops(pa),pa[1],a): product(product(A[m,n],n=1..pa[1]),m=1..nops(pa)); end: with(combinat): rev:=proc(a) [seq(a[nops(a)+1-i],i=1..nops(a))] end: sort([seq(H(rev(partition(6)[q])),q=1..numbpart(6))]);

h[l_] := With[{n = Length[l]}, Total[l]!/Product[Product[1 + l[[i]] - j + Sum[If[l[[k]] >= j, 1, 0], {k, i+1, n}], {j, 1, l[[i]]}], {i, 1, n}]];
g[n_, i_, l_] := If[n == 0 || i == 1, h[Join[l, Array[1&, n]]], If[i < 1, 0, Flatten@Table[g[n - i*j, i-1, Join[l, Array[i&, j]]], {j, 0, n/i}]]];
T[n_] := g[n, n, {}];
Sort[6!/T[6]] (* Jean-François Alcover, Jul 20 2024, after Alois P. Heinz in A060240 *)

a(n) = 6!/A003870(12-n).

cp's OEIS Frontend

A060240 Triangle T(n,k) in which n-th row gives degrees of irreducible representations of symmetric group S_n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Extensions

A003040 Highest degree of an irreducible representation of symmetric group S_n of degree n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Sage

Extensions

A003869 Degrees of irreducible representations of symmetric group S_5.

Views

Author

Keywords

Comments

References

Crossrefs

Programs

GAP

Magma

Mathematica

A104707 Triangle read by rows distributing the 1602 multinomials described by A005651(6) related to Young tableau and Kostka numbers.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

A093764 Hook products of all partitions of 6.

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

Formula