Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
St001499: Dyck paths ⟶ ℤ
Values
[1,1] => [1,0,1,0] => [1,1,0,0] => 1
[2] => [1,1,0,0] => [1,0,1,0] => 1
[1,1,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 1
[1,2] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 2
[2,1] => [1,1,0,0,1,0] => [1,0,1,0,1,0] => 2
[3] => [1,1,1,0,0,0] => [1,1,0,0,1,0] => 1
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 1
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 2
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0] => 3
[1,3] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 2
[2,1,1] => [1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0] => 2
[2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0] => 3
[3,1] => [1,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,0] => 2
[4] => [1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 1
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 2
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => 3
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 2
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 3
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => 4
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => 3
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => 2
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 3
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 4
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 3
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,0,1,0] => 2
[5] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 1
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 2
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 3
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 2
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 4
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 3
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 2
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 3
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => 4
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 4
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 3
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 4
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 3
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 2
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => 3
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 4
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => 3
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => 4
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 5
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 4
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 2
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => 3
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 4
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => 3
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 2
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => 3
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => 2
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => 1
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 2
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => 3
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 2
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,1,1,0,0,1,0,0,0,0] => 3
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => 4
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,1,0,1,0,0,1,0,0,0,0] => 3
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => 2
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,1,0,0,0] => 3
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,1,1,0,1,0,0,1,0,0,0] => 4
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => 5
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,1,1,0,0,1,0,1,0,0,0] => 4
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,1,1,0,0,0,1,0,0,0] => 3
[1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,1,0,1,0,0,1,0,0,0] => 4
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,1,0,0,0,1,0,0,0] => 3
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 2
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,1,0,0] => 3
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,0,1,1,1,0,1,0,0,0,1,0,0] => 4
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,0,1,0,0] => 5
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,1,0,0] => 4
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,1,0,0] => 5
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => 6
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,1,0,0] => 5
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => 4
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => 3
[1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,1,0,1,1,0,1,0,0,0,1,0,0] => 4
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => 5
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,1,0,1,1,0,0,1,0,0,1,0,0] => 4
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,1,0,0] => 3
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,1,0,1,0,1,0,0,0,1,0,0] => 4
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => 3
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => 2
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 2
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,1,0,0,0,0,1,0] => 3
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,1,1,0,1,0,1,0,0,0,1,0] => 4
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0,1,0] => 3
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,1,0,0,1,0,0,1,0] => 4
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0,1,0] => 5
[2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,0,1,0,0,1,0] => 4
>>> 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 number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra.
We use the bijection in the code by Christian Stump to have a bijection to Dyck paths.
We use the bijection in the code by Christian Stump to have a bijection to Dyck paths.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
Knuth-Krattenthaler
Description
The map that sends the Dyck path to a 321-avoiding permutation, then applies the Robinson-Schensted correspondence and finally interprets the first row of the insertion tableau and the second row of the recording tableau as up steps.
Interpreting a pair of two-row standard tableaux of the same shape as a Dyck path is explained by Knuth in [1, pp. 60].
Krattenthaler's bijection between Dyck paths and $321$-avoiding permutations used is Mp00119to 321-avoiding permutation (Krattenthaler), see [2].
This is the inverse of the map Mp00127left-to-right-maxima to Dyck path that interprets the left-to-right maxima of the permutation obtained from Mp00024to 321-avoiding permutation as a Dyck path.
Interpreting a pair of two-row standard tableaux of the same shape as a Dyck path is explained by Knuth in [1, pp. 60].
Krattenthaler's bijection between Dyck paths and $321$-avoiding permutations used is Mp00119to 321-avoiding permutation (Krattenthaler), see [2].
This is the inverse of the map Mp00127left-to-right-maxima to Dyck path that interprets the left-to-right maxima of the permutation obtained from Mp00024to 321-avoiding permutation as a Dyck path.
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!