Identifier
-
Mp00083:
Standard tableaux
—shape⟶
Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001171: Permutations ⟶ ℤ (values match St000055The inversion sum of a permutation.)
Values
[[1]] => [1] => [1,0] => [1] => 0
[[1,2]] => [2] => [1,0,1,0] => [1,2] => 0
[[1],[2]] => [1,1] => [1,1,0,0] => [2,1] => 1
[[1,2,3]] => [3] => [1,0,1,0,1,0] => [1,2,3] => 0
[[1,3],[2]] => [2,1] => [1,0,1,1,0,0] => [1,3,2] => 1
[[1,2],[3]] => [2,1] => [1,0,1,1,0,0] => [1,3,2] => 1
[[1],[2],[3]] => [1,1,1] => [1,1,0,1,0,0] => [2,3,1] => 3
[[1,2,3,4]] => [4] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 0
[[1,3,4],[2]] => [3,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 1
[[1,2,4],[3]] => [3,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 1
[[1,2,3],[4]] => [3,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 1
[[1,3],[2,4]] => [2,2] => [1,1,1,0,0,0] => [3,1,2] => 3
[[1,2],[3,4]] => [2,2] => [1,1,1,0,0,0] => [3,1,2] => 3
[[1,4],[2],[3]] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 3
[[1,3],[2],[4]] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 3
[[1,2],[3],[4]] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 3
[[1],[2],[3],[4]] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 6
[[1,3,5],[2,4]] => [3,2] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 3
[[1,2,5],[3,4]] => [3,2] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 3
[[1,3,4],[2,5]] => [3,2] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 3
[[1,2,4],[3,5]] => [3,2] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 3
[[1,2,3],[4,5]] => [3,2] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 3
[[1,4],[2,5],[3]] => [2,2,1] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 5
[[1,3],[2,5],[4]] => [2,2,1] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 5
[[1,2],[3,5],[4]] => [2,2,1] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 5
[[1,3],[2,4],[5]] => [2,2,1] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 5
[[1,2],[3,4],[5]] => [2,2,1] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 5
[[1,3,5],[2,4,6]] => [3,3] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 8
[[1,2,5],[3,4,6]] => [3,3] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 8
[[1,3,4],[2,5,6]] => [3,3] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 8
[[1,2,4],[3,5,6]] => [3,3] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 8
[[1,2,3],[4,5,6]] => [3,3] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 8
[[1,4],[2,5],[3,6]] => [2,2,2] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 6
[[1,3],[2,5],[4,6]] => [2,2,2] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 6
[[1,2],[3,5],[4,6]] => [2,2,2] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 6
[[1,3],[2,4],[5,6]] => [2,2,2] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 6
[[1,2],[3,4],[5,6]] => [2,2,2] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 6
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 vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$.
Map
shape
Description
Sends a tableau to its shape.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!