- FindStat

Identifier

Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001061: Permutations ⟶ ℤ

Values

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

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} = 4 + q$

$F_{4} = 10 + 4\ q$

Description

The number of indices that are both descents and recoils of a permutation.

Map

prime Dyck path

Description

Return the Dyck path obtained by adding an initial up and a final down step.

Map

inverse Kreweras complement

Description

Return the inverse of the Kreweras complement of a Dyck path, regarded as a noncrossing set partition.
To identify Dyck paths and noncrossing set partitions, this maps uses the following classical bijection. The number of down steps after the

$i$ -th up step of the Dyck path is the size of the block of the set partition whose maximal element is

$i$ . If

$i$ is not a maximal element of a block, the

$(i+1)$ -st step is also an up step.

Map

Ringel

Description

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