Identifier
-
Mp00223:
Permutations
—runsort⟶
Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St001171: Permutations ⟶ ℤ (values match St000055The inversion sum of a permutation.)
Values
[1] => [1] => [1] => 0
[1,2] => [1,2] => [1,2] => 0
[2,1] => [1,2] => [1,2] => 0
[1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,2,3] => 0
[2,1,3] => [1,3,2] => [1,2,3] => 0
[2,3,1] => [1,2,3] => [1,2,3] => 0
[3,1,2] => [1,2,3] => [1,2,3] => 0
[3,2,1] => [1,2,3] => [1,2,3] => 0
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => [1,2,3,4] => 0
[1,3,2,4] => [1,3,2,4] => [1,2,3,4] => 0
[1,3,4,2] => [1,3,4,2] => [1,2,3,4] => 0
[1,4,2,3] => [1,4,2,3] => [1,2,4,3] => 1
[1,4,3,2] => [1,4,2,3] => [1,2,4,3] => 1
[2,1,3,4] => [1,3,4,2] => [1,2,3,4] => 0
[2,1,4,3] => [1,4,2,3] => [1,2,4,3] => 1
[2,3,1,4] => [1,4,2,3] => [1,2,4,3] => 1
[2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0
[2,4,1,3] => [1,3,2,4] => [1,2,3,4] => 0
[2,4,3,1] => [1,2,4,3] => [1,2,3,4] => 0
[3,1,2,4] => [1,2,4,3] => [1,2,3,4] => 0
[3,1,4,2] => [1,4,2,3] => [1,2,4,3] => 1
[3,2,1,4] => [1,4,2,3] => [1,2,4,3] => 1
[3,2,4,1] => [1,2,4,3] => [1,2,3,4] => 0
[3,4,1,2] => [1,2,3,4] => [1,2,3,4] => 0
[3,4,2,1] => [1,2,3,4] => [1,2,3,4] => 0
[4,1,2,3] => [1,2,3,4] => [1,2,3,4] => 0
[4,1,3,2] => [1,3,2,4] => [1,2,3,4] => 0
[4,2,1,3] => [1,3,2,4] => [1,2,3,4] => 0
[4,2,3,1] => [1,2,3,4] => [1,2,3,4] => 0
[4,3,1,2] => [1,2,3,4] => [1,2,3,4] => 0
[4,3,2,1] => [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 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
runsort
Description
The permutation obtained by sorting the increasing runs lexicographically.
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.
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!