- FindStat

Identifier

Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000516: Permutations ⟶ ℤ

Values

[1,0] => [1,0] => [1,0] => [2,1] => 0
[1,0,1,0] => [1,0,1,0] => [1,1,0,0] => [2,3,1] => 0
[1,1,0,0] => [1,1,0,0] => [1,0,1,0] => [3,1,2] => 0
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [2,3,4,1] => 0
[1,0,1,1,0,0] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [4,3,1,2] => 0
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [4,3,1,2] => 0
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [1,1,0,0,1,0] => [2,4,1,3] => 0
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 0
[1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 0
[1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0] => [5,4,1,2,3] => 0
[1,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 0
[1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 0
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 1
[1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0] => [5,4,1,2,3] => 0
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 0
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 0
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 0
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 0
[1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => [6,5,4,1,2,3] => 0
[1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 0
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 0
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [6,3,1,5,2,4] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => [6,5,4,1,2,3] => 0
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 0
[1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [6,3,5,1,2,4] => 0
[1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 0
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 2
[1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [6,1,4,2,3,5] => 1
[1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 0
[1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [6,1,4,2,3,5] => 1
[1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 1
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [6,3,1,5,2,4] => 1
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 0
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [6,3,5,1,2,4] => 0
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[1,1,0,1,1,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] => [3,1,6,2,4,5] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 0
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => 1
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => 0
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 0
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => 0
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 1
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [6,3,5,1,2,4] => 0
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => 0
[1,1,1,0,1,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] => [3,1,6,2,4,5] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 0
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,0,1,0] => [6,3,4,1,2,5] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => 0
[1,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] => [3,1,6,2,4,5] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => 0

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

$F_{1} = 1$

$F_{2} = 2$

$F_{3} = 5$

$F_{4} = 13 + q$

$F_{5} = 30 + 11\ q + q^{2}$

Description

The number of stretching pairs of a permutation.
This is the number of pairs

$(i,j)$ with

$\pi(i) < i < j < \pi(j)$ .

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.

Map

Ringel

Description

The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.

Map

bounce path

Description

Sends a Dyck path

$D$ of length

$2n$ to its bounce path.
This path is formed by starting at the endpoint

$(n,n)$ of

$D$ and travelling west until encountering the first vertical step of

$D$ , then south until hitting the diagonal, then west again to hit

$D$ , etc. until the point

$(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.