- FindStat

Identifier

Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001526: Dyck paths ⟶ ℤ

Values

[1,0] => [2,1] => [1,1,0,0] => [1,0,1,0] => 2
[1,0,1,0] => [3,1,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
[1,1,0,0] => [2,3,1] => [1,1,0,1,0,0] => [1,1,1,0,0,0] => 3
[1,0,1,0,1,0] => [4,1,2,3] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 2
[1,0,1,1,0,0] => [3,1,4,2] => [1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => 3
[1,1,0,0,1,0] => [2,4,1,3] => [1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0] => 3
[1,1,0,1,0,0] => [4,3,1,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 2
[1,1,1,0,0,0] => [2,3,4,1] => [1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0] => 4
[1,0,1,0,1,0,1,0] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 2
[1,0,1,0,1,1,0,0] => [4,1,2,5,3] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,0,0,1,0] => [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 3
[1,0,1,1,0,1,0,0] => [5,1,4,2,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 2
[1,0,1,1,1,0,0,0] => [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => 4
[1,1,0,0,1,0,1,0] => [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 3
[1,1,0,0,1,1,0,0] => [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => 3
[1,1,0,1,0,0,1,0] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 2
[1,1,0,1,0,1,0,0] => [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 2
[1,1,0,1,1,0,0,0] => [4,3,1,5,2] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0] => 3
[1,1,1,0,0,0,1,0] => [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => 4
[1,1,1,0,0,1,0,0] => [2,5,4,1,3] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 3
[1,1,1,0,1,0,0,0] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 2
[1,1,1,1,0,0,0,0] => [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 5
[] => [1] => [1,0] => [1,0] => 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} = q^{2}$

$F_{2} = q^{2} + q^{3}$

$F_{3} = 2\ q^{2} + 2\ q^{3} + q^{4}$

$F_{4} = 5\ q^{2} + 6\ q^{3} + 2\ q^{4} + q^{5}$

Description

The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the 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.

Map

Ringel

Description

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

Map

Delest-Viennot

Description

Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
Let

$D$ be a Dyck path of semilength

$n$ . The parallelogram polyomino

$\gamma(D)$ is defined as follows: let

$\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to

$D$ . Then, the upper path of

$\gamma(D)$ corresponds to the sequence of steps of

$\tilde D$ with even indices, and the lower path of

$\gamma(D)$ corresponds to the sequence of steps of

$\tilde D$ with odd indices.
The Delest-Viennot bijection

$\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path

$(\gamma^{(-1)}\circ\beta)(D)$ .