- FindStat

Identifier

Mp00075: Semistandard tableaux —reading word permutation⟶ Permutations
Mp00252: Permutations —restriction⟶ Permutations
Mp00131: Permutations —descent bottoms⟶ Binary words
St001491: Binary words ⟶ ℤ

Values

[[1,2],[2]] => [2,1,3] => [2,1] => 1 => 1

[[1,3],[2]] => [2,1,3] => [2,1] => 1 => 1

[[1,3],[3]] => [2,1,3] => [2,1] => 1 => 1

[[2,3],[3]] => [2,1,3] => [2,1] => 1 => 1

[[1],[2],[3]] => [3,2,1] => [2,1] => 1 => 1

[[1,1,2],[2]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,2,2],[2]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,1],[2,2]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,4],[2]] => [2,1,3] => [2,1] => 1 => 1

[[1,4],[3]] => [2,1,3] => [2,1] => 1 => 1

[[1,4],[4]] => [2,1,3] => [2,1] => 1 => 1

[[2,4],[3]] => [2,1,3] => [2,1] => 1 => 1

[[2,4],[4]] => [2,1,3] => [2,1] => 1 => 1

[[3,4],[4]] => [2,1,3] => [2,1] => 1 => 1

[[1],[2],[4]] => [3,2,1] => [2,1] => 1 => 1

[[1],[3],[4]] => [3,2,1] => [2,1] => 1 => 1

[[2],[3],[4]] => [3,2,1] => [2,1] => 1 => 1

[[1,1,3],[2]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,1,3],[3]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,2,3],[2]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,2,3],[3]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,3,3],[2]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,3,3],[3]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[2,2,3],[3]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[2,3,3],[3]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,1],[2,3]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,1],[3,3]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,2],[2,3]] => [2,4,1,3] => [2,1,3] => 10 => 1

[[1,2],[3,3]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[2,2],[3,3]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,1],[2],[3]] => [4,3,1,2] => [3,1,2] => 10 => 1

[[1,2],[2],[3]] => [4,2,1,3] => [2,1,3] => 10 => 1

[[1,3],[2],[3]] => [3,2,1,4] => [3,2,1] => 11 => 2

[[1,1,1,2],[2]] => [4,1,2,3,5] => [4,1,2,3] => 100 => 1

[[1,1,2,2],[2]] => [3,1,2,4,5] => [3,1,2,4] => 100 => 1

[[1,2,2,2],[2]] => [2,1,3,4,5] => [2,1,3,4] => 100 => 1

[[1,1,1],[2,2]] => [4,5,1,2,3] => [4,1,2,3] => 100 => 1

[[1,1,2],[2,2]] => [3,4,1,2,5] => [3,4,1,2] => 100 => 1

[[1,5],[2]] => [2,1,3] => [2,1] => 1 => 1

[[1,5],[3]] => [2,1,3] => [2,1] => 1 => 1

[[1,5],[4]] => [2,1,3] => [2,1] => 1 => 1

[[1,5],[5]] => [2,1,3] => [2,1] => 1 => 1

[[2,5],[3]] => [2,1,3] => [2,1] => 1 => 1

[[2,5],[4]] => [2,1,3] => [2,1] => 1 => 1

[[2,5],[5]] => [2,1,3] => [2,1] => 1 => 1

[[3,5],[4]] => [2,1,3] => [2,1] => 1 => 1

[[3,5],[5]] => [2,1,3] => [2,1] => 1 => 1

[[4,5],[5]] => [2,1,3] => [2,1] => 1 => 1

[[1],[2],[5]] => [3,2,1] => [2,1] => 1 => 1

[[1],[3],[5]] => [3,2,1] => [2,1] => 1 => 1

[[1],[4],[5]] => [3,2,1] => [2,1] => 1 => 1

[[2],[3],[5]] => [3,2,1] => [2,1] => 1 => 1

[[2],[4],[5]] => [3,2,1] => [2,1] => 1 => 1

[[3],[4],[5]] => [3,2,1] => [2,1] => 1 => 1

[[1,1,4],[2]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,1,4],[3]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,1,4],[4]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,2,4],[2]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,2,4],[3]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,3,4],[2]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,2,4],[4]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,4,4],[2]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,3,4],[3]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,3,4],[4]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[1,4,4],[3]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,4,4],[4]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[2,2,4],[3]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[2,2,4],[4]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[2,3,4],[3]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[2,3,4],[4]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[2,4,4],[3]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[2,4,4],[4]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[3,3,4],[4]] => [3,1,2,4] => [3,1,2] => 10 => 1

[[3,4,4],[4]] => [2,1,3,4] => [2,1,3] => 10 => 1

[[1,1],[2,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,1],[3,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,1],[4,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,2],[2,4]] => [2,4,1,3] => [2,1,3] => 10 => 1

[[1,2],[3,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,3],[2,4]] => [2,4,1,3] => [2,1,3] => 10 => 1

[[1,2],[4,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,3],[3,4]] => [2,4,1,3] => [2,1,3] => 10 => 1

[[1,3],[4,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[2,2],[3,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[2,2],[4,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[2,3],[3,4]] => [2,4,1,3] => [2,1,3] => 10 => 1

[[2,3],[4,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[3,3],[4,4]] => [3,4,1,2] => [3,1,2] => 10 => 1

[[1,1],[2],[4]] => [4,3,1,2] => [3,1,2] => 10 => 1

[[1,1],[3],[4]] => [4,3,1,2] => [3,1,2] => 10 => 1

[[1,2],[2],[4]] => [4,2,1,3] => [2,1,3] => 10 => 1

[[1,2],[3],[4]] => [4,3,1,2] => [3,1,2] => 10 => 1

[[1,3],[2],[4]] => [4,2,1,3] => [2,1,3] => 10 => 1

[[1,4],[2],[3]] => [3,2,1,4] => [3,2,1] => 11 => 2

[[1,4],[2],[4]] => [3,2,1,4] => [3,2,1] => 11 => 2

[[1,3],[3],[4]] => [4,2,1,3] => [2,1,3] => 10 => 1

[[1,4],[3],[4]] => [3,2,1,4] => [3,2,1] => 11 => 2

[[2,2],[3],[4]] => [4,3,1,2] => [3,1,2] => 10 => 1

[[2,3],[3],[4]] => [4,2,1,3] => [2,1,3] => 10 => 1

[[2,4],[3],[4]] => [3,2,1,4] => [3,2,1] => 11 => 2

[[1],[2],[3],[4]] => [4,3,2,1] => [3,2,1] => 11 => 2

>>> Load all 1547 entries. <<<

search for individual values

searching the database for the individual values of this statistic

Description

The number of indecomposable projective-injective modules in the algebra corresponding to a subset.
Let

$A_n=K[x]/(x^n)$ .
We associate to a nonempty subset S of an (n-1)-set the module

$M_S$ , which is the direct sum of

$A_n$ -modules with indecomposable non-projective direct summands of dimension

$i$ when

$i$ is in

$S$ (note that such modules have vector space dimension at most n-1). Then the corresponding algebra associated to S is the stable endomorphism ring of

$M_S$ . We decode the subset as a binary word so that for example the subset

$S=\{1,3 \}$ of

$\{1,2,3 \}$ is decoded as 101.

Map

reading word permutation

Description

Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottommost row (in English notation).

Map

descent bottoms

Description

The descent bottoms of a permutation as a binary word.

Map

restriction

Description

The permutation obtained by removing the largest letter.
This map is undefined for the empty permutation.