Identifier
Values
[[1]] => [[1]] => [1] => [1,0,1,0] => 2
[[1,0],[0,1]] => [[1,1],[2]] => [2,1] => [1,0,1,0,1,0] => 2
[[0,1],[1,0]] => [[1,2],[2]] => [2,1] => [1,0,1,0,1,0] => 2
[[1,0,0],[0,1,0],[0,0,1]] => [[1,1,1],[2,2],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 2
[[0,1,0],[1,0,0],[0,0,1]] => [[1,1,2],[2,2],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 2
[[1,0,0],[0,0,1],[0,1,0]] => [[1,1,1],[2,3],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 2
[[0,1,0],[1,-1,1],[0,1,0]] => [[1,1,2],[2,3],[3]] => [2,2,2] => [1,1,0,0,1,1,1,0,0,0] => 3
[[0,0,1],[1,0,0],[0,1,0]] => [[1,1,3],[2,3],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 2
[[0,1,0],[0,0,1],[1,0,0]] => [[1,2,2],[2,3],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 2
[[0,0,1],[0,1,0],[1,0,0]] => [[1,2,3],[2,3],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 2
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]] => [[1,1,1,1],[2,2,2],[3,3],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]] => [[1,1,1,2],[2,2,2],[3,3],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]] => [[1,1,1,1],[2,2,3],[3,3],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]] => [[1,1,1,3],[2,2,3],[3,3],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,1,0,0],[0,0,1,0],[1,0,0,0],[0,0,0,1]] => [[1,1,2,2],[2,2,3],[3,3],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]] => [[1,1,2,3],[2,2,3],[3,3],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]] => [[1,1,1,1],[2,2,2],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]] => [[1,1,1,2],[2,2,2],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]] => [[1,1,1,1],[2,2,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]] => [[1,1,1,4],[2,2,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,1,0,0],[0,0,0,1],[1,0,0,0],[0,0,1,0]] => [[1,1,2,2],[2,2,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,0,1],[0,1,0,0],[1,0,0,0],[0,0,1,0]] => [[1,1,2,4],[2,2,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[1,0,0,0],[0,0,1,0],[0,0,0,1],[0,1,0,0]] => [[1,1,1,1],[2,3,3],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,1,0],[1,0,0,0],[0,0,0,1],[0,1,0,0]] => [[1,1,1,3],[2,3,3],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]] => [[1,1,1,1],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,0,1],[1,0,0,0],[0,0,1,0],[0,1,0,0]] => [[1,1,1,4],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,1,0],[0,0,0,1],[1,0,0,0],[0,1,0,0]] => [[1,1,3,3],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,0,1],[0,0,1,0],[1,0,0,0],[0,1,0,0]] => [[1,1,3,4],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]] => [[1,2,2,2],[2,3,3],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,1,0],[0,1,0,0],[0,0,0,1],[1,0,0,0]] => [[1,2,2,3],[2,3,3],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,1,0,0],[0,0,0,1],[0,0,1,0],[1,0,0,0]] => [[1,2,2,2],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,0,1],[0,1,0,0],[0,0,1,0],[1,0,0,0]] => [[1,2,2,4],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,1,0],[0,0,0,1],[0,1,0,0],[1,0,0,0]] => [[1,2,3,3],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]] => [[1,2,3,4],[2,3,4],[3,4],[4]] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => 2
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
Description
The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
to semistandard tableau via monotone triangles
Description
The semistandard tableau corresponding the monotone triangle of an alternating sign matrix.
This is obtained by interpreting each row of the monotone triangle as an integer partition, and filling the cells of the smallest partition with ones, the second smallest with twos, and so on.
Map
weight
Description
The weight of a semistandard tableau as an integer partition.
The weight (or content) of a semistandard tableaux $T$ with maximal entry $m$ is the weak composition $(\alpha_1, \dots, \alpha_m)$ such that $\alpha_i$ is the number of letters $i$ occurring in $T$.
This map returns the integer partition obtained by sorting the weight into decreasing order and omitting zeros.
Since semistandard tableaux are bigraded by the size of the partition and the maximal occurring entry, this map is not graded.