Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St001880: Posets ⟶ ℤ
Values
[2,1] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => ([(0,2),(2,1)],3) => 3
[3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => ([(0,1),(0,2),(1,3),(2,3)],4) => 4
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 1
[5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6) => 1
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 4
[6,1] => [1,1,1,1,1,0,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 1
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 5
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6) => 2
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 5
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => 4
[6,2,1] => [1,1,1,1,0,1,0,1,0,0,0,0,1,0] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7) => 2
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => 2
[6,2,1,1] => [1,1,1,0,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,0,1,1,1,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7) => 2
[5,4,1] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6) => 2
[5,2,1,1,1] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6) => 1
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[6,2,1,1,1] => [1,1,0,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,1,0,1,1,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7) => 1
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 6
[5,3,1,1,1] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6) => 2
[6,5,1] => [1,1,1,1,0,1,0,0,0,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7) => 2
[6,3,2,1] => [1,1,1,0,1,0,1,0,1,0,0,0,1,0] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(2,6),(3,6),(4,6),(5,1),(6,5)],7) => 3
[6,2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,1,0,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7) => 1
[5,4,2,1] => [1,1,0,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 6
[5,3,2,1,1] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => 5
[6,3,2,1,1] => [1,1,0,1,1,0,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,0,1,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(2,6),(3,5),(4,5),(5,6),(6,1)],7) => 3
[6,3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0,1,0] => [1,0,1,1,1,1,0,0,1,0,0,0,1,0] => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7) => 1
[5,4,3,1] => [1,1,0,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => 6
[5,4,2,1,1] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => 5
[5,3,2,2,1] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 6
[6,5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7) => 3
[6,4,3,1] => [1,1,1,0,1,0,0,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => 7
[6,4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0,1,0] => [1,0,1,1,1,1,0,0,0,1,0,0,1,0] => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7) => 2
[6,3,2,1,1,1] => [1,0,1,1,1,0,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,1,0,0,0,1,0] => ([(0,3),(0,4),(0,5),(1,6),(3,6),(4,6),(5,1),(6,2)],7) => 2
[6,5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0,1,0] => [1,0,1,1,0,1,1,0,0,0,1,0,1,0] => ([(0,4),(1,6),(2,5),(3,5),(4,1),(4,2),(4,3),(5,6)],7) => 3
[6,4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0,1,0] => [1,0,1,0,1,1,1,0,0,1,0,0,1,0] => ([(0,4),(0,5),(1,6),(2,6),(4,6),(5,1),(5,2),(6,3)],7) => 3
[6,3,2,2,1,1] => [1,0,1,1,0,1,1,0,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(1,5),(2,6),(3,6),(4,1),(4,6),(6,5)],7) => 2
[5,4,3,2,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[6,5,4,1] => [1,1,1,0,1,0,0,0,1,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(3,6),(4,5),(5,1),(5,2),(5,3)],7) => 3
[6,5,2,1,1,1] => [1,0,1,1,1,0,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,1,0,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(4,3),(5,1),(5,2),(5,4)],7) => 2
[6,4,3,2,1] => [1,1,0,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => 7
[6,4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,1,0,0,1,0] => ([(0,3),(0,4),(1,6),(2,5),(3,5),(4,1),(4,2),(5,6)],7) => 3
[6,3,2,2,2,1] => [1,0,1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,1),(4,5),(5,6)],7) => 1
[6,5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => 7
[6,5,3,1,1,1] => [1,0,1,1,1,0,0,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,1,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(4,2),(4,3),(5,1),(5,4)],7) => 3
[6,4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,1,0,0,1,0] => ([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => 6
[6,4,2,2,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,1,0,1,0,0,1,0,0,1,0] => ([(0,3),(0,4),(1,6),(2,6),(3,5),(4,1),(4,2),(4,5),(5,6)],7) => 2
[6,5,4,3,2,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
[6,5,3,2,2,1] => [1,0,1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0,1,0,1,0] => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => 7
[6,4,3,2,2,1] => [1,0,1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,1,0,1,0,0,1,0] => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => 7
[6,5,4,2,1,1] => [1,0,1,1,0,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => 6
[6,5,3,2,1,1] => [1,0,1,1,0,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => 6
[6,5,4,3,1] => [1,1,0,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => 7
[6,5,4,2,1] => [1,1,0,1,0,1,0,0,1,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 7
search for individual values
searching the database for the individual values of this statistic
Description
The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice.
Map
switch returns and last double rise
Description
An alternative to the Adin-Bagno-Roichman transformation of a Dyck path.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
Map
Hessenberg poset
Description
The Hessenberg poset of a Dyck path.
Let D be a Dyck path of semilength n, regarded as a subdiagonal path from (0,0) to (n,n), and let \boldsymbol{m}_i be the x-coordinate of the i-th up step.
Then the Hessenberg poset (or natural unit interval order) corresponding to D has elements \{1,\dots,n\} with i < j if j < \boldsymbol{m}_i.
Let D be a Dyck path of semilength n, regarded as a subdiagonal path from (0,0) to (n,n), and let \boldsymbol{m}_i be the x-coordinate of the i-th up step.
Then the Hessenberg poset (or natural unit interval order) corresponding to D has elements \{1,\dots,n\} with i < j if j < \boldsymbol{m}_i.
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!