- FindStat

Identifier

Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001291: Dyck paths ⟶ ℤ

Values

[1,0] => [1,0] => 1

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

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

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

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

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

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

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

[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 4

[1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0] => 4

[1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,1,0,0,0,1,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0] => 4

[1,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0] => 4

[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,1,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 5

[1,1,0,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,1,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 5

[1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,1,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 5

[1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 5

[1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => 5

[1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => 5

[1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 5

[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 5

[1,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 5

[1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,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,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 6

[1,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,1,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 6

[1,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 6

>>> Load all 196 entries. <<<

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$

$F_{2} = 2\ q^{2}$

$F_{3} = 5\ q^{3}$

$F_{4} = 14\ q^{4}$

$F_{5} = 42\ q^{5}$

$F_{6} = 132\ q^{6}$

Description

The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path.
Let

$A$ be the Nakayama algebra associated to a Dyck path as given in DyckPaths/NakayamaAlgebras. This statistics is the number of indecomposable summands of

$D(A) \otimes D(A)$ , where

$D(A)$ is the natural dual of

$A$ .

Map

peeling map

Description

Send a Dyck path to its peeled Dyck path.