- FindStat

Identifier

Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St001231: Dyck paths ⟶ ℤ (values match St001234The number of indecomposable three dimensional modules with projective dimension one.)

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 131 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} = 1$

$F_{2} = 1 + q$

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

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

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

Description

The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension.
Actually the same statistics results for algebras with at most 7 simple modules when dropping the assumption that the module has projective dimension one. The author is not sure whether this holds in general.

Map

promotion

Description

The promotion of the two-row standard Young tableau of a Dyck path.
Dyck paths of semilength

$n$ are in bijection with standard Young tableaux of shape

$(n^2)$ , see Mp00033to two-row standard tableau.
This map is the bijection on such standard Young tableaux given by Schützenberger's promotion. For definitions and details, see [1] and the references therein.

Map

to Dyck path

Description

Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.