Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St001165: Dyck paths ⟶ ℤ (values match St001471The magnitude of a Dyck path.)
Values
[1] => [1,0,1,0] => [1,1,0,0] => [1,0,1,0] => 2
[2] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,0,1,1,0,0] => 2
[1,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => 2
[3] => [1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => 2
[2,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0] => 2
[4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => 2
[3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => 2
[2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 2
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => 2
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0] => 2
[3,2] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => 2
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 2
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 3
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 3
[1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 3
[5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,1,0,1,1,0,0,0,0] => 2
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => 2
[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => 2
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 3
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 2
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 3
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 2
[2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => 3
[5,2] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,1,0,0,0] => 3
[5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => 2
[4,3] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 2
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 3
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => 2
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 3
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 2
[3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => 3
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 3
[2,2,1,1,1] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => 3
[5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => 3
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,1,0,0,1,1,0,0,0] => 3
[5,1,1,1] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[4,4] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,1,1,0,1,0,0,0,0] => 2
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0] => 2
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 2
[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => 3
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => 3
[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 3
[3,2,1,1,1] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 3
[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => 3
[2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => 3
[5,4] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 2
[5,3,1] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => 2
[5,2,2] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => 2
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => 2
[5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 3
[4,4,1] => [1,1,1,0,1,0,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,1,1,0,1,0,0,0] => 3
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => 3
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 3
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 3
[4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => 2
[3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => 3
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 3
[3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => 3
[3,2,2,2] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => 3
[3,2,2,1,1] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 3
[2,2,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 3
[5,4,1] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 3
[5,3,2] => [1,1,1,0,0,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => 3
[5,3,1,1] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,0,0,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,1,0,0] => 2
[5,2,2,1] => [1,1,0,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[5,2,1,1,1] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => 3
[4,4,2] => [1,1,1,0,0,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => 3
[4,4,1,1] => [1,1,0,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => 2
[4,3,3] => [1,1,1,0,0,0,1,1,0,1,0,0] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => 3
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 3
[4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 3
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,1,0,0] => 3
[4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => 2
[3,3,3,1] => [1,1,0,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => 3
[3,3,2,2] => [1,1,0,0,1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,1,0,0] => 3
[3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => 2
[3,2,2,2,1] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => 3
[5,4,2] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => 3
[5,4,1,1] => [1,1,0,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 2
[5,3,3] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => 3
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[5,3,1,1,1] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 3
[5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => 3
[5,2,2,1,1] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => 3
[4,4,3] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => 3
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => 2
[4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => 3
[4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => 3
[4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => 3
[4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 2
[4,2,2,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => 3
[3,3,3,2] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => 3
[3,3,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 3
[3,3,2,2,1] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => 3
>>> Load all 131 entries. <<<
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
Number of simple modules with even projective dimension in the corresponding Nakayama algebra.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
swap returns and last descent
Description
Return a Dyck path with number of returns and length of the last descent interchanged.
This is the specialisation of the map $\Phi$ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.
This is the specialisation of the map $\Phi$ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.
Map
inverse Kreweras complement
Description
Return the inverse of the Kreweras complement of a Dyck path, regarded as a noncrossing set partition.
To identify Dyck paths and noncrossing set partitions, this maps uses the following classical bijection. The number of down steps after the $i$-th up step of the Dyck path is the size of the block of the set partition whose maximal element is $i$. If $i$ is not a maximal element of a block, the $(i+1)$-st step is also an up step.
To identify Dyck paths and noncrossing set partitions, this maps uses the following classical bijection. The number of down steps after the $i$-th up step of the Dyck path is the size of the block of the set partition whose maximal element is $i$. If $i$ is not a maximal element of a block, the $(i+1)$-st step is also an up step.
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!