-
appear more than once (or not at all) in a tableau. A
tableau is
called semistandard, or
column strict, if the
entries weakly increase along each row and...
-
between matrices A with non-negative
integer entries and
pairs (P,Q) of
semistandard Young tableaux of
equal shape,
whose size
equals the sum of the entries...
- end of the
sliding procedure. Jeu de
taquin slides generalize to skew
semistandard (as
opposed to skew standard)
tableaux and
retain most of
their properties...
-
integers modulo Knuth equivalence. Its
elements can be
identified with
semistandard Young tableaux. It was
discovered by
Donald Knuth (1970) (who called...
- {\displaystyle \mu } ) is a non-negative
integer that is
equal to the
number of
semistandard Young tableaux of
shape λ {\displaystyle \lambda } and
weight μ {\displaystyle...
- combinatorics, a Bender–Knuth
involution is an
involution on the set of
semistandard tableaux,
introduced by
Bender &
Knuth (1972, pp. 46–47) in
their study...
-
depending on two
partitions λ and μ, that is
equal to the
number of
semistandard Young tableaux of
shape λ and
weight μ
Kostka polynomial or Kostka–Foulkes...
- Richardson (1934)
contains an error. A Littlewood–Richardson
tableau is a skew
semistandard tableau with the
additional property that the
sequence obtained by concatenating...
- vigorous. b) Tukey,
Dwarfed fruit trees, 1964 d= dwarf, sd=semidwarf, ss=
semistandard, s= standard. c) Tukey,
Dwarfed fruit trees, 1964 6=
highest winter hardiness...
-
terms of P {\displaystyle P} -tableaux
which are a
generalization of
semistandard Young tableaux instead labelled with the
elements of P {\displaystyle...
