Identifier
-
Mp00080:
Set partitions
—to permutation⟶
Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
St001207: Permutations ⟶ ℤ
Values
{{1,2}} => [2,1] => [1,2] => [1,2] => 0
{{1},{2}} => [1,2] => [1,2] => [1,2] => 0
{{1,2,3}} => [2,3,1] => [1,2,3] => [1,2,3] => 0
{{1,2},{3}} => [2,1,3] => [1,2,3] => [1,2,3] => 0
{{1,3},{2}} => [3,2,1] => [1,3,2] => [3,1,2] => 2
{{1},{2,3}} => [1,3,2] => [1,2,3] => [1,2,3] => 0
{{1},{2},{3}} => [1,2,3] => [1,2,3] => [1,2,3] => 0
{{1,2,3,4}} => [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0
{{1,2,3},{4}} => [2,3,1,4] => [1,2,3,4] => [1,2,3,4] => 0
{{1,2,4},{3}} => [2,4,3,1] => [1,2,4,3] => [4,1,2,3] => 3
{{1,2},{3,4}} => [2,1,4,3] => [1,2,3,4] => [1,2,3,4] => 0
{{1,2},{3},{4}} => [2,1,3,4] => [1,2,3,4] => [1,2,3,4] => 0
{{1,3,4},{2}} => [3,2,4,1] => [1,3,4,2] => [3,4,1,2] => 3
{{1,3},{2,4}} => [3,4,1,2] => [1,3,2,4] => [3,1,2,4] => 2
{{1,3},{2},{4}} => [3,2,1,4] => [1,3,2,4] => [3,1,2,4] => 2
{{1,4},{2,3}} => [4,3,2,1] => [1,4,2,3] => [1,4,2,3] => 2
{{1},{2,3,4}} => [1,3,4,2] => [1,2,3,4] => [1,2,3,4] => 0
{{1},{2,3},{4}} => [1,3,2,4] => [1,2,3,4] => [1,2,3,4] => 0
{{1,4},{2},{3}} => [4,2,3,1] => [1,4,2,3] => [1,4,2,3] => 2
{{1},{2,4},{3}} => [1,4,3,2] => [1,2,4,3] => [4,1,2,3] => 3
{{1},{2},{3,4}} => [1,2,4,3] => [1,2,3,4] => [1,2,3,4] => 0
{{1},{2},{3},{4}} => [1,2,3,4] => [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 permutation
Description
Sends the set partition to the permutation obtained by considering the blocks as increasing cycles.
Map
inverse Foata bijection
Description
The inverse of Foata's bijection.
See Mp00067Foata bijection.
See Mp00067Foata bijection.
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!