Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001206: Dyck paths ⟶ ℤ (values match St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.)
Values
[2] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 2
[1,1] => [1,0,1,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] => 2
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,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] => 2
[3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 2
[2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 2
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0] => 2
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 2
[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] => 2
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 3
[3,2] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => 2
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => 2
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
[1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 2
[5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 2
[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 2
[3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 2
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => 2
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 2
[2,2,1,1] => [1,0,1,1,0,1,1,0,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,1,0,0,1,0,1,0,1,0,0] => 3
[5,2] => [1,1,1,1,0,0,1,0,0,0,1,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,1,0,1,0,1,0,0,1,1,0,0] => 3
[4,3] => [1,1,1,0,0,0,1,0,1,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,1,1,0,0,0,0] => 2
[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 2
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,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] => 2
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 2
[3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => 3
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 2
[2,2,1,1,1] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => 3
[5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => 2
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 3
[5,1,1,1] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,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,0,1,0] => 2
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 2
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 2
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => 2
[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => 2
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 2
[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 2
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[3,2,1,1,1] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 3
[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 2
[2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => 2
[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] => 2
[5,3,1] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => 3
[5,2,2] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => 2
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 3
[5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => 2
[4,4,1] => [1,1,1,0,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,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] => 2
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => 3
[3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => 2
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 2
[3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 2
[3,2,2,2] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,1,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,1,0,0,1,0,0,1,0,0] => 3
[2,2,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => 2
[5,4,1] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 3
[5,3,2] => [1,1,1,0,0,1,0,1,0,0,1,0] => [1,0,1,1,1,0,1,1,0,0,0,0] => 2
[5,3,1,1] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => 2
[5,2,2,1] => [1,1,0,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,0,1,1,0,0] => 2
[5,2,1,1,1] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 3
[4,4,2] => [1,1,1,0,0,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => 2
[4,4,1,1] => [1,1,0,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,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] => 2
[4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => 2
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => 2
[4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 2
[3,3,3,1] => [1,1,0,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => 2
[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,0,1,0] => 2
[3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,1,0,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,1,0,0,0,1,0,1,0,0] => 3
[5,4,2] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => 2
[5,4,1,1] => [1,1,0,1,1,0,0,0,1,0,1,0] => [1,1,0,1,0,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,0,1,1,0,0] => 2
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => 2
[5,3,1,1,1] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => 2
[5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => 2
[5,2,2,1,1] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => 2
[4,4,3] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => 2
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 2
[4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => 2
[4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 2
[4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => 2
[4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 2
[4,2,2,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => 2
[3,3,3,2] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 2
[3,3,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => 2
[3,3,2,2,1] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => 2
[5,4,3] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 2
[5,4,2,1] => [1,1,0,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 2
[5,4,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 2
[5,3,3,1] => [1,1,0,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => 2
>>> Load all 126 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
The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$.
Map
Lalanne-Kreweras involution
Description
The Lalanne-Kreweras involution on Dyck paths.
Label the upsteps from left to right and record the labels on the first up step of each double rise. Do the same for the downsteps. Then form the Dyck path whose ascent lengths and descent lengths are the consecutives differences of the labels.
Label the upsteps from left to right and record the labels on the first up step of each double rise. Do the same for the downsteps. Then form the Dyck path whose ascent lengths and descent lengths are the consecutives differences of the labels.
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!