- FindStat

Identifier

Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
St001198: Dyck paths ⟶ ℤ (values match St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$.)

Values

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

search for individual values

searching the database for the individual values of this statistic

Description

The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.

Map

peeling map

Description

Send a Dyck path to its peeled Dyck path.

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.