Identifier
-
Mp00120:
Dyck paths
—Lalanne-Kreweras involution⟶
Dyck paths
St001223: Dyck paths ⟶ ℤ (values match St000932The number of occurrences of the pattern UDU in a Dyck path., St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.)
Values
[1,0] => [1,0] => 0
[1,0,1,0] => [1,1,0,0] => 0
[1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0,1,0] => [1,1,1,0,0,0] => 0
[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] => 1
[1,1,0,1,0,0] => [1,1,0,1,0,0] => 1
[1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 0
[1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => 0
[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] => 0
[1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => 1
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 1
[1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 1
[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] => 1
[1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => 2
[1,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0] => 2
[1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => 2
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 3
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 0
[1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => 0
[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] => 0
[1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 0
[1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0] => 0
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => 1
[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] => 2
[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] => 1
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 1
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => 1
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 2
[1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 1
[1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 1
[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] => 1
[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] => 1
[1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => 1
[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] => 2
[1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 2
[1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 2
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 2
[1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => 2
[1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 3
[1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 3
[1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 3
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 4
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 0
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 0
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 0
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 0
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 0
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 0
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 0
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => 0
[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] => 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
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,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,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] => 1
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 0
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 0
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => 0
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 0
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => 0
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => 0
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 0
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 0
[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] => 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] => 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] => 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] => 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] => 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] => 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] => 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] => 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
Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless.
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!