Identifier
Values
[1] => [1,0,1,0] => [1,2] => [1,2] => 0
[2] => [1,1,0,0,1,0] => [2,1,3] => [1,2,3] => 0
[1,1] => [1,0,1,1,0,0] => [1,3,2] => [1,2,3] => 0
[3] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => [1,3,2,4] => 1
[2,1] => [1,0,1,0,1,0] => [1,2,3] => [1,2,3] => 0
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,2,4,3] => 1
[3,1] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => [1,2,3,4] => 0
[2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => [1,2,3,4] => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => [1,2,3,4] => 0
[3,2] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => [1,2,3,4] => 0
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => [1,2,3,4] => 0
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => [1,2,3,4] => 0
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => 0
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 Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
Map
cycle-as-one-line notation
Description
Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.