Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
St001035: Dyck paths ⟶ ℤ
Values
[1,1] => [1,0,1,0] => 0
[2] => [1,1,0,0] => 0
[1,1,1] => [1,0,1,0,1,0] => 0
[1,2] => [1,0,1,1,0,0] => 1
[2,1] => [1,1,0,0,1,0] => 1
[3] => [1,1,1,0,0,0] => 1
[1,1,1,1] => [1,0,1,0,1,0,1,0] => 0
[1,1,2] => [1,0,1,0,1,1,0,0] => 1
[1,2,1] => [1,0,1,1,0,0,1,0] => 2
[1,3] => [1,0,1,1,1,0,0,0] => 1
[2,1,1] => [1,1,0,0,1,0,1,0] => 1
[2,2] => [1,1,0,0,1,1,0,0] => 2
[3,1] => [1,1,1,0,0,0,1,0] => 1
[4] => [1,1,1,1,0,0,0,0] => 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => 2
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => 2
[1,4] => [1,0,1,1,1,1,0,0,0,0] => 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => 3
[2,3] => [1,1,0,0,1,1,1,0,0,0] => 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => 1
[3,2] => [1,1,1,0,0,0,1,1,0,0] => 2
[4,1] => [1,1,1,1,0,0,0,0,1,0] => 1
[5] => [1,1,1,1,1,0,0,0,0,0] => 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => 2
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => 2
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => 2
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => 4
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => 3
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => 3
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => 1
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => 2
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => 3
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => 2
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => 3
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => 4
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => 3
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => 1
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => 2
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => 3
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => 1
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => 1
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => 0
[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,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => 2
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => 1
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => 2
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => 3
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => 2
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => 1
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => 2
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => 3
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => 4
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0] => 3
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => 2
[1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => 3
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => 2
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => 1
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => 2
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => 3
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => 4
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => 3
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => 4
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => 5
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => 4
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => 3
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => 2
[1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => 3
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => 4
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => 3
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => 2
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => 3
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 2
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => 1
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => 1
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => 2
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => 3
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => 2
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => 3
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => 4
[2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => 3
>>> Load all 222 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 convexity degree of the parallelogram polyomino associated with the Dyck path.
A parallelogram polyomino is $k$-convex if $k$ is the maximal number of turns an axis-parallel path must take to connect two cells of the polyomino.
For example, any rotation of a Ferrers shape has convexity degree at most one.
The (bivariate) generating function is given in Theorem 2 of [1].
A parallelogram polyomino is $k$-convex if $k$ is the maximal number of turns an axis-parallel path must take to connect two cells of the polyomino.
For example, any rotation of a Ferrers shape has convexity degree at most one.
The (bivariate) generating function is given in Theorem 2 of [1].
Map
bounce path
Description
The bounce path determined by an integer composition.
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!