Processing math: 100%

Identifier
Values
[1,0,1,0] => [1,1,0,0] => [[0,1],[1,0]] => [2,1] => 1
[1,1,0,0] => [1,0,1,0] => [[1,0],[0,1]] => [1,2] => 0
[1,0,1,0,1,0] => [1,1,1,0,0,0] => [[0,0,1],[0,1,0],[1,0,0]] => [3,2,1] => 2
[1,0,1,1,0,0] => [1,1,0,1,0,0] => [[0,1,0],[1,-1,1],[0,1,0]] => [1,3,2] => 1
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [[0,1,0],[1,0,0],[0,0,1]] => [2,1,3] => 1
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [[1,0,0],[0,0,1],[0,1,0]] => [1,3,2] => 1
[1,1,1,0,0,0] => [1,0,1,0,1,0] => [[1,0,0],[0,1,0],[0,0,1]] => [1,2,3] => 0
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]] => [4,3,2,1] => 3
[1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]] => [1,4,3,2] => 2
[1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]] => [2,1,4,3] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]] => [1,4,3,2] => 2
[1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]] => [1,2,4,3] => 1
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0] => [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]] => [3,2,1,4] => 2
[1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]] => [1,3,2,4] => 1
[1,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]] => [2,1,4,3] => 1
[1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0] => [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]] => [1,4,3,2] => 2
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]] => [1,2,4,3] => 1
[1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,0] => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]] => [2,1,3,4] => 1
[1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]] => [1,3,2,4] => 1
[1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]] => [1,2,4,3] => 1
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]] => [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
click to show known generating functions       
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]/(xn).
Map
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength 0 is sent to itself.
Let D be a Dyck path of semilength n>0 and decompose it into 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
Map
to symmetric ASM
Description
The diagonally symmetric alternating sign matrix corresponding to a Dyck path.
Map
to left key permutation
Description
Return the permutation of the left key of an alternating sign matrix.
This was originally defined by Lascoux and then further studied by Aval [1].