Identifier
-
Mp00120:
Dyck paths
—Lalanne-Kreweras involution⟶
Dyck paths
St001234: Dyck paths ⟶ ℤ (values match St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension.)
Values
[1,0] => [1,0] => 0
[1,0,1,0] => [1,1,0,0] => 0
[1,1,0,0] => [1,0,1,0] => 0
[1,0,1,0,1,0] => [1,1,1,0,0,0] => 1
[1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
[1,1,0,0,1,0] => [1,0,1,1,0,0] => 0
[1,1,0,1,0,0] => [1,1,0,1,0,0] => 0
[1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 2
[1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 0
[1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 0
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => 0
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 0
[1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0] => 0
[1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => 0
[1,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0] => 0
[1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => 0
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 3
[1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 0
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 0
[1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 0
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => 0
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 0
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 0
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 0
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 0
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 0
[1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 0
[1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 0
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 0
[1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => 0
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
[1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => 0
[1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 0
[1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 0
[1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => 0
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 0
[1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 0
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 0
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => 0
[1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 0
[1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => 0
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 4
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 3
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 3
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[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
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => 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] => 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] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 0
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 0
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => 0
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => 0
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 1
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 3
[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
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => 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] => 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] => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => 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] => 0
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => 0
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => 0
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => 0
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 0
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 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] => 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] => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => 1
>>> Load all 196 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 number of indecomposable three dimensional modules with projective dimension one.
It return zero when there are no such modules.
It return zero when there are no such modules.
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.
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!