- FindStat

Identifier

Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000024: Dyck paths ⟶ ℤ (values match St000443The number of long tunnels of a Dyck path., St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path., St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra., St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra.)

Values

[1] => [1,0] => 0

[1,2] => [1,0,1,0] => 0

[2,1] => [1,1,0,0] => 1

[1,2,3] => [1,0,1,0,1,0] => 0

[1,3,2] => [1,0,1,1,0,0] => 1

[2,1,3] => [1,1,0,0,1,0] => 1

[2,3,1] => [1,1,0,1,0,0] => 1

[3,1,2] => [1,1,1,0,0,0] => 2

[3,2,1] => [1,1,1,0,0,0] => 2

[1,2,3,4] => [1,0,1,0,1,0,1,0] => 0

[1,2,4,3] => [1,0,1,0,1,1,0,0] => 1

[1,3,2,4] => [1,0,1,1,0,0,1,0] => 1

[1,3,4,2] => [1,0,1,1,0,1,0,0] => 1

[1,4,2,3] => [1,0,1,1,1,0,0,0] => 2

[1,4,3,2] => [1,0,1,1,1,0,0,0] => 2

[2,1,3,4] => [1,1,0,0,1,0,1,0] => 1

[2,1,4,3] => [1,1,0,0,1,1,0,0] => 2

[2,3,1,4] => [1,1,0,1,0,0,1,0] => 1

[2,3,4,1] => [1,1,0,1,0,1,0,0] => 1

[2,4,1,3] => [1,1,0,1,1,0,0,0] => 2

[2,4,3,1] => [1,1,0,1,1,0,0,0] => 2

[3,1,2,4] => [1,1,1,0,0,0,1,0] => 2

[3,1,4,2] => [1,1,1,0,0,1,0,0] => 2

[3,2,1,4] => [1,1,1,0,0,0,1,0] => 2

[3,2,4,1] => [1,1,1,0,0,1,0,0] => 2

[3,4,1,2] => [1,1,1,0,1,0,0,0] => 2

[3,4,2,1] => [1,1,1,0,1,0,0,0] => 2

[4,1,2,3] => [1,1,1,1,0,0,0,0] => 3

[4,1,3,2] => [1,1,1,1,0,0,0,0] => 3

[4,2,1,3] => [1,1,1,1,0,0,0,0] => 3

[4,2,3,1] => [1,1,1,1,0,0,0,0] => 3

[4,3,1,2] => [1,1,1,1,0,0,0,0] => 3

[4,3,2,1] => [1,1,1,1,0,0,0,0] => 3

[1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0] => 0

[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0] => 1

[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0] => 1

[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0] => 1

[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0] => 2

[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0] => 2

[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0] => 1

[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0] => 2

[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0] => 1

[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0] => 1

[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0] => 2

[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0] => 2

[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0] => 2

[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0] => 2

[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0] => 2

[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0] => 2

[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0] => 2

[1,4,5,3,2] => [1,0,1,1,1,0,1,0,0,0] => 2

[1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0] => 3

[1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0] => 3

[1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0] => 3

[1,5,3,4,2] => [1,0,1,1,1,1,0,0,0,0] => 3

[1,5,4,2,3] => [1,0,1,1,1,1,0,0,0,0] => 3

[1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0] => 3

[2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0] => 1

[2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0] => 2

[2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0] => 2

[2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0] => 2

[2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0] => 3

[2,1,5,4,3] => [1,1,0,0,1,1,1,0,0,0] => 3

[2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0] => 1

[2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0] => 2

[2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0] => 1

[2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0] => 1

[2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0] => 2

[2,3,5,4,1] => [1,1,0,1,0,1,1,0,0,0] => 2

[2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0] => 2

[2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0] => 2

[2,4,3,1,5] => [1,1,0,1,1,0,0,0,1,0] => 2

[2,4,3,5,1] => [1,1,0,1,1,0,0,1,0,0] => 2

[2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0] => 2

[2,4,5,3,1] => [1,1,0,1,1,0,1,0,0,0] => 2

[2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0] => 3

[2,5,1,4,3] => [1,1,0,1,1,1,0,0,0,0] => 3

[2,5,3,1,4] => [1,1,0,1,1,1,0,0,0,0] => 3

[2,5,3,4,1] => [1,1,0,1,1,1,0,0,0,0] => 3

[2,5,4,1,3] => [1,1,0,1,1,1,0,0,0,0] => 3

[2,5,4,3,1] => [1,1,0,1,1,1,0,0,0,0] => 3

[3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0] => 2

[3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0] => 3

[3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0] => 2

[3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0] => 2

[3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0] => 3

[3,1,5,4,2] => [1,1,1,0,0,1,1,0,0,0] => 3

[3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0] => 2

[3,2,1,5,4] => [1,1,1,0,0,0,1,1,0,0] => 3

[3,2,4,1,5] => [1,1,1,0,0,1,0,0,1,0] => 2

[3,2,4,5,1] => [1,1,1,0,0,1,0,1,0,0] => 2

[3,2,5,1,4] => [1,1,1,0,0,1,1,0,0,0] => 3

[3,2,5,4,1] => [1,1,1,0,0,1,1,0,0,0] => 3

[3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0] => 2

[3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0] => 2

[3,4,2,1,5] => [1,1,1,0,1,0,0,0,1,0] => 2

[3,4,2,5,1] => [1,1,1,0,1,0,0,1,0,0] => 2

[3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 2

[3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0] => 2

[3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0] => 3

[3,5,1,4,2] => [1,1,1,0,1,1,0,0,0,0] => 3

>>> Load all 5914 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

click to show known generating functions

Description

The number of double up and double down steps of a Dyck path.
In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.

Map

left-to-right-maxima to Dyck path

Description

The left-to-right maxima of a permutation as a Dyck path.
Let $(c_1, \dots, c_k)$ be the rise composition Mp00102rise composition of the path. Then the corresponding left-to-right maxima are $c_1, c_1+c_2, \dots, c_1+\dots+c_k$.
Restricted to 321-avoiding permutations, this is the inverse of Mp00119to 321-avoiding permutation (Krattenthaler), restricted to 312-avoiding permutations, this is the inverse of Mp00031to 312-avoiding permutation.