- FindStat

Identifier

Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St001206: Dyck paths ⟶ ℤ (values match St001198The 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$ .)

Values

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

search for individual values

searching the database for the individual values of this statistic

Description

The 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$ .

Map

parallelogram polyomino

Description

Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.

Map

swap returns and last descent

Description

Return a Dyck path with number of returns and length of the last descent interchanged.
This is the specialisation of the map

$\Phi$ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.

Map

peeling map

Description

Send a Dyck path to its peeled Dyck path.