Identifier
-
Mp00021:
Cores
—to bounded partition⟶
Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001583: Permutations ⟶ ℤ (values match St000246The number of non-inversions of a permutation.)
Values
([2],3) => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 3
([1,1],3) => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 3
([3,1],3) => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 3
([2],4) => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 3
([1,1],4) => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 3
([2,1],4) => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 3
([2],5) => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 3
([1,1],5) => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 3
([2,1],5) => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 3
([2],6) => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 3
([1,1],6) => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 3
([2,1],6) => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 3
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 projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order.
Map
to bounded partition
Description
The (k-1)-bounded partition of a k-core.
Starting with a $k$-core, deleting all cells of hook length greater than or equal to $k$ yields a $(k-1)$-bounded partition [1, Theorem 7], see also [2, Section 1.2].
Starting with a $k$-core, deleting all cells of hook length greater than or equal to $k$ yields a $(k-1)$-bounded partition [1, Theorem 7], see also [2, Section 1.2].
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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!