Your data matches 38 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00231: Integer compositions bounce pathDyck paths
St001035: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> 0
[2] => [1,1,0,0]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> 0
[1,2] => [1,0,1,1,0,0]
=> 1
[2,1] => [1,1,0,0,1,0]
=> 1
[3] => [1,1,1,0,0,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,3] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,1] => [1,1,1,0,0,0,1,0]
=> 1
[4] => [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 3
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[5] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> 2
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> 4
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 1
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> 2
Description
The convexity degree of the parallelogram polyomino associated with the Dyck path. A parallelogram polyomino is $k$-convex if $k$ is the maximal number of turns an axis-parallel path must take to connect two cells of the polyomino. For example, any rotation of a Ferrers shape has convexity degree at most one. The (bivariate) generating function is given in Theorem 2 of [1].
Mp00231: Integer compositions bounce pathDyck paths
Mp00143: Dyck paths inverse promotionDyck paths
Mp00124: Dyck paths Adin-Bagno-Roichman transformationDyck paths
St000970: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0
[2] => [1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,2] => [1,0,1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0
[2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[3] => [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 3
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> 2
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 4
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 3
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 3
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 2
Description
Number of peaks minus the dominant dimension of the corresponding LNakayama algebra.
Matching statistic: St001486
Mp00231: Integer compositions bounce pathDyck paths
Mp00142: Dyck paths promotionDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
St001486: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> [2] => 2 = 0 + 2
[2] => [1,1,0,0]
=> [1,0,1,0]
=> [1,1] => 2 = 0 + 2
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => 3 = 1 + 2
[1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1] => 3 = 1 + 2
[2,1] => [1,1,0,0,1,0]
=> [1,1,1,0,0,0]
=> [3] => 2 = 0 + 2
[3] => [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => 3 = 1 + 2
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => 3 = 1 + 2
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => 3 = 1 + 2
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => 4 = 2 + 2
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 4 = 2 + 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => 3 = 1 + 2
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => 3 = 1 + 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 2 = 0 + 2
[4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 3 = 1 + 2
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 3 = 1 + 2
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 3 = 1 + 2
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 4 = 2 + 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => 4 = 2 + 2
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 5 = 3 + 2
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 5 = 3 + 2
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 4 = 2 + 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 4 = 2 + 2
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,1,1] => 3 = 1 + 2
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => 3 = 1 + 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => 4 = 2 + 2
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => 4 = 2 + 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => 3 = 1 + 2
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => 3 = 1 + 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => 2 = 0 + 2
[5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 3 = 1 + 2
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1,1] => 3 = 1 + 2
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1,1] => 3 = 1 + 2
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,1,1,2] => 4 = 2 + 2
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [2,1,1,2] => 4 = 2 + 2
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [2,1,2,1] => 5 = 3 + 2
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [2,1,2,1] => 5 = 3 + 2
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [2,1,3] => 4 = 2 + 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [2,1,3] => 4 = 2 + 2
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,2,1,1] => 5 = 3 + 2
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [2,2,1,1] => 5 = 3 + 2
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,2,2] => 6 = 4 + 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [2,2,2] => 6 = 4 + 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,3,1] => 5 = 3 + 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [2,3,1] => 5 = 3 + 2
[1,4,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]
=> [2,4] => 4 = 2 + 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,4] => 4 = 2 + 2
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,1,1] => 3 = 1 + 2
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [3,1,1,1] => 3 = 1 + 2
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,1,2] => 4 = 2 + 2
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> [3,1,2] => 4 = 2 + 2
Description
The number of corners of the ribbon associated with an integer composition. We associate a ribbon shape to a composition $c=(c_1,\dots,c_n)$ with $c_i$ cells in the $i$-th row from bottom to top, such that the cells in two rows overlap in precisely one cell. This statistic records the total number of corners of the ribbon shape.
Mp00231: Integer compositions bounce pathDyck paths
Mp00101: Dyck paths decomposition reverseDyck paths
Mp00143: Dyck paths inverse promotionDyck paths
St001012: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 0 + 3
[2] => [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 3 = 0 + 3
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> 4 = 1 + 3
[1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 0 + 3
[2,1] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4 = 1 + 3
[3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 4 = 1 + 3
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 5 = 2 + 3
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 4 = 1 + 3
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 4 = 1 + 3
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 0 + 3
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 5 = 2 + 3
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 4 = 1 + 3
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 4 = 1 + 3
[4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 4 = 1 + 3
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 6 = 3 + 3
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 5 = 2 + 3
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 5 = 2 + 3
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4 = 1 + 3
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 5 = 2 + 3
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4 = 1 + 3
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 1 + 3
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 3 = 0 + 3
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 6 = 3 + 3
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 5 = 2 + 3
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 5 = 2 + 3
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 1 + 3
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 5 = 2 + 3
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4 = 1 + 3
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4 = 1 + 3
[5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 1 + 3
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 7 = 4 + 3
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 6 = 3 + 3
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> 6 = 3 + 3
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 5 = 2 + 3
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> 6 = 3 + 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 5 = 2 + 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 5 = 2 + 3
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 4 = 1 + 3
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 6 = 3 + 3
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 5 = 2 + 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 5 = 2 + 3
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 4 = 1 + 3
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 5 = 2 + 3
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 4 = 1 + 3
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 4 = 1 + 3
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 3 = 0 + 3
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 7 = 4 + 3
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> 6 = 3 + 3
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> 6 = 3 + 3
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 5 = 2 + 3
Description
Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001036
Mp00231: Integer compositions bounce pathDyck paths
Mp00027: Dyck paths to partitionInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St001036: Dyck paths ⟶ ℤResult quality: 95% values known / values provided: 95%distinct values known / distinct values provided: 100%
Values
[1,1] => [1,0,1,0]
=> [1]
=> [1,0,1,0]
=> 0
[2] => [1,1,0,0]
=> []
=> []
=> ? = 0
[1,1,1] => [1,0,1,0,1,0]
=> [2,1]
=> [1,0,1,0,1,0]
=> 0
[1,2] => [1,0,1,1,0,0]
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
[2,1] => [1,1,0,0,1,0]
=> [2]
=> [1,1,0,0,1,0]
=> 1
[3] => [1,1,1,0,0,0]
=> []
=> []
=> ? = 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 1
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,2]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 1
[4] => [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? = 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[5] => [1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> ? = 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 2
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 4
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 1
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> 2
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 4
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 3
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> []
=> ? = 1
[7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> []
=> []
=> ? = 1
Description
The number of inner corners of the parallelogram polyomino associated with the Dyck path.
Matching statistic: St001280
Mp00231: Integer compositions bounce pathDyck paths
Mp00101: Dyck paths decomposition reverseDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St001280: Integer partitions ⟶ ℤResult quality: 83% values known / values provided: 91%distinct values known / distinct values provided: 83%
Values
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 0
[2] => [1,1,0,0]
=> [1,0,1,0]
=> [1]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 1
[1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> 0
[2,1] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> 1
[3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [2,1]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 1
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> 2
[4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 2
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 1
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> 2
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> 2
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> 2
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> 2
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> 2
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> 3
[5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> 3
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 1
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1]
=> 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2]
=> 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [2,1]
=> 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [3]
=> 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [3,1]
=> 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [3,2]
=> 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [3,2,1]
=> 2
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [4]
=> 1
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [4,1]
=> 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [4,2]
=> 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [4,2,1]
=> 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [4,3]
=> 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [4,3,1]
=> 2
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [4,3,2]
=> 3
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1]
=> 3
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5]
=> 1
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [5,1]
=> 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [5,2]
=> 2
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [5,2,1]
=> 2
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [5,3]
=> 2
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> 2
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> 3
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1]
=> 3
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [5,4]
=> 2
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> []
=> ? ∊ {1,4,4,4,5,5}
[4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1]
=> ? ∊ {1,4,4,4,5,5}
[5,1,1] => [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,0,1,0]
=> [6,5,4,3]
=> ? ∊ {1,4,4,4,5,5}
[5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1]
=> ? ∊ {1,4,4,4,5,5}
[6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2]
=> ? ∊ {1,4,4,4,5,5}
[7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1]
=> ? ∊ {1,4,4,4,5,5}
Description
The number of parts of an integer partition that are at least two.
Matching statistic: St001183
Mp00180: Integer compositions to ribbonSkew partitions
Mp00183: Skew partitions inner shapeInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
St001183: Dyck paths ⟶ ℤResult quality: 79% values known / values provided: 79%distinct values known / distinct values provided: 83%
Values
[1,1] => [[1,1],[]]
=> []
=> []
=> ? ∊ {0,0}
[2] => [[2],[]]
=> []
=> []
=> ? ∊ {0,0}
[1,1,1] => [[1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[1,2] => [[2,1],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[2,1] => [[2,2],[1]]
=> [1]
=> [1,0]
=> 1
[3] => [[3],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[1,1,1,1] => [[1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,1,2] => [[2,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,2,1] => [[2,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3] => [[3,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[2,1,1] => [[2,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2] => [[3,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1] => [[3,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4] => [[4],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,1,1,1,1] => [[1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,1,2] => [[2,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,2,1] => [[2,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,3] => [[3,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,2,1,1] => [[2,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,2,2] => [[3,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3,1] => [[3,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,4] => [[4,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[2,1,1,1] => [[2,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[2,1,2] => [[3,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2,1] => [[3,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[2,3] => [[4,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1,1] => [[3,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 2
[3,2] => [[4,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4,1] => [[4,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[5] => [[5],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,1,1,1,1] => [[1,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,1,2] => [[2,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,2,1] => [[2,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,3] => [[3,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,2,2] => [[3,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,3,1] => [[3,3,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,4] => [[4,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,2,1,1,1] => [[2,2,2,2,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[1,2,3] => [[4,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3,1,1] => [[3,3,3,1],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 2
[1,3,2] => [[4,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,4,1] => [[4,4,1],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[1,5] => [[5,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[2,1,1,1,1] => [[2,2,2,2,2],[1,1,1,1]]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
[2,1,1,2] => [[3,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 3
[2,1,3] => [[4,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2,1,1] => [[3,3,3,2],[2,2,1]]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 3
[2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 4
[2,4] => [[5,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1,1,1] => [[3,3,3,3],[2,2,2]]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 2
[3,1,2] => [[4,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 2
[3,2,1] => [[4,4,3],[3,2]]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3
[3,3] => [[5,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4,1,1] => [[4,4,4],[3,3]]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 2
[4,2] => [[5,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[5,1] => [[5,5],[4]]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 4
[6] => [[6],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,1,1,1,1] => [[1,1,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,1,1,2] => [[2,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,1,2,1] => [[2,2,1,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,1,3] => [[3,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,2,1,1] => [[2,2,2,1,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,1,2,2] => [[3,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,3,1] => [[3,3,1,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,1,4] => [[4,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,2,1,1,1] => [[2,2,2,2,1,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,1,2,1,2] => [[3,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,2,2,1] => [[3,3,2,1,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[1,1,2,3] => [[4,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,5] => [[5,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,6] => [[6,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[7] => [[7],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
Description
The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001258
Mp00180: Integer compositions to ribbonSkew partitions
Mp00183: Skew partitions inner shapeInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
St001258: Dyck paths ⟶ ℤResult quality: 79% values known / values provided: 79%distinct values known / distinct values provided: 83%
Values
[1,1] => [[1,1],[]]
=> []
=> []
=> ? ∊ {0,0}
[2] => [[2],[]]
=> []
=> []
=> ? ∊ {0,0}
[1,1,1] => [[1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[1,2] => [[2,1],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[2,1] => [[2,2],[1]]
=> [1]
=> [1,0]
=> 1
[3] => [[3],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[1,1,1,1] => [[1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,1,2] => [[2,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,2,1] => [[2,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3] => [[3,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[2,1,1] => [[2,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2] => [[3,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1] => [[3,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4] => [[4],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,1,1,1,1] => [[1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,1,2] => [[2,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,2,1] => [[2,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,3] => [[3,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,2,1,1] => [[2,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,2,2] => [[3,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3,1] => [[3,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,4] => [[4,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[2,1,1,1] => [[2,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[2,1,2] => [[3,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2,1] => [[3,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[2,3] => [[4,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1,1] => [[3,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 2
[3,2] => [[4,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4,1] => [[4,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[5] => [[5],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,1,1,1,1] => [[1,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,1,2] => [[2,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,2,1] => [[2,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,3] => [[3,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,2,2] => [[3,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,3,1] => [[3,3,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,4] => [[4,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,2,1,1,1] => [[2,2,2,2,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[1,2,3] => [[4,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3,1,1] => [[3,3,3,1],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 2
[1,3,2] => [[4,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,4,1] => [[4,4,1],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[1,5] => [[5,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[2,1,1,1,1] => [[2,2,2,2,2],[1,1,1,1]]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
[2,1,1,2] => [[3,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 3
[2,1,3] => [[4,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2,1,1] => [[3,3,3,2],[2,2,1]]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 3
[2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 4
[2,4] => [[5,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1,1,1] => [[3,3,3,3],[2,2,2]]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 2
[3,1,2] => [[4,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 2
[3,2,1] => [[4,4,3],[3,2]]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3
[3,3] => [[5,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4,1,1] => [[4,4,4],[3,3]]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 2
[4,2] => [[5,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[5,1] => [[5,5],[4]]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 4
[6] => [[6],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,1,1,1,1] => [[1,1,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,1,1,2] => [[2,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,1,2,1] => [[2,2,1,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,1,3] => [[3,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,2,1,1] => [[2,2,2,1,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,1,2,2] => [[3,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,3,1] => [[3,3,1,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,1,4] => [[4,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,2,1,1,1] => [[2,2,2,2,1,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,1,2,1,2] => [[3,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,2,2,1] => [[3,3,2,1,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
[1,1,2,3] => [[4,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,5] => [[5,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,6] => [[6,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[7] => [[7],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
Description
Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. For at most 6 simple modules this statistic coincides with the injective dimension of the regular module as a bimodule.
Matching statistic: St001526
Mp00180: Integer compositions to ribbonSkew partitions
Mp00183: Skew partitions inner shapeInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
St001526: Dyck paths ⟶ ℤResult quality: 79% values known / values provided: 79%distinct values known / distinct values provided: 83%
Values
[1,1] => [[1,1],[]]
=> []
=> []
=> ? ∊ {0,0}
[2] => [[2],[]]
=> []
=> []
=> ? ∊ {0,0}
[1,1,1] => [[1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[1,2] => [[2,1],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[2,1] => [[2,2],[1]]
=> [1]
=> [1,0]
=> 1
[3] => [[3],[]]
=> []
=> []
=> ? ∊ {0,1,1}
[1,1,1,1] => [[1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,1,2] => [[2,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,2,1] => [[2,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3] => [[3,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[2,1,1] => [[2,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2] => [[3,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1] => [[3,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4] => [[4],[]]
=> []
=> []
=> ? ∊ {0,1,1,1}
[1,1,1,1,1] => [[1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,1,2] => [[2,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,2,1] => [[2,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,3] => [[3,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,2,1,1] => [[2,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,2,2] => [[3,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3,1] => [[3,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,4] => [[4,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[2,1,1,1] => [[2,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 3
[2,1,2] => [[3,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2,1] => [[3,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[2,3] => [[4,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1,1] => [[3,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 3
[3,2] => [[4,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4,1] => [[4,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 2
[5] => [[5],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1}
[1,1,1,1,1,1] => [[1,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,1,2] => [[2,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,2,1] => [[2,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,3] => [[3,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,2,1,1] => [[2,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,2,2] => [[3,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,3,1] => [[3,3,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,4] => [[4,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,2,1,1,1] => [[2,2,2,2,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 3
[1,2,1,2] => [[3,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,2,2,1] => [[3,3,2,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,2,3] => [[4,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,3,1,1] => [[3,3,3,1],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 3
[1,3,2] => [[4,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,4,1] => [[4,4,1],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 2
[1,5] => [[5,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[2,1,1,1,1] => [[2,2,2,2,2],[1,1,1,1]]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 3
[2,1,1,2] => [[3,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 3
[2,1,2,1] => [[3,3,2,2],[2,1,1]]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 3
[2,1,3] => [[4,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[2,2,1,1] => [[3,3,3,2],[2,2,1]]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 3
[2,2,2] => [[4,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[2,3,1] => [[4,4,2],[3,1]]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 2
[2,4] => [[5,2],[1]]
=> [1]
=> [1,0]
=> 1
[3,1,1,1] => [[3,3,3,3],[2,2,2]]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 4
[3,1,2] => [[4,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 3
[3,2,1] => [[4,4,3],[3,2]]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3
[3,3] => [[5,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[4,1,1] => [[4,4,4],[3,3]]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 4
[4,2] => [[5,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 2
[5,1] => [[5,5],[4]]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 2
[6] => [[6],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1}
[1,1,1,1,1,1,1] => [[1,1,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,1,1,2] => [[2,1,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,1,2,1] => [[2,2,1,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,1,3] => [[3,1,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,1,2,1,1] => [[2,2,2,1,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,1,2,2] => [[3,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,3,1] => [[3,3,1,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,1,4] => [[4,1,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,1,2,1,1,1] => [[2,2,2,2,1,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 3
[1,1,2,1,2] => [[3,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 2
[1,1,2,2,1] => [[3,3,2,1,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,2,3] => [[4,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,5] => [[5,1,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[1,6] => [[6,1],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
[7] => [[7],[]]
=> []
=> []
=> ? ∊ {0,1,1,1,1,1,1}
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.
Matching statistic: St000159
Mp00231: Integer compositions bounce pathDyck paths
Mp00027: Dyck paths to partitionInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000159: Integer partitions ⟶ ℤResult quality: 76% values known / values provided: 76%distinct values known / distinct values provided: 83%
Values
[1,1] => [1,0,1,0]
=> [1]
=> []
=> 0
[2] => [1,1,0,0]
=> []
=> ?
=> ? = 0
[1,1,1] => [1,0,1,0,1,0]
=> [2,1]
=> [1]
=> 1
[1,2] => [1,0,1,1,0,0]
=> [1,1]
=> [1]
=> 1
[2,1] => [1,1,0,0,1,0]
=> [2]
=> []
=> 0
[3] => [1,1,1,0,0,0]
=> []
=> ?
=> ? = 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [2,1]
=> 2
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [2,1]
=> 2
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [1,1]
=> 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,1]
=> 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [3,2]
=> [2]
=> 1
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,2]
=> [2]
=> 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [3]
=> []
=> 0
[4] => [1,1,1,1,0,0,0,0]
=> []
=> ?
=> ? = 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> [3,2,1]
=> 3
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> [3,2,1]
=> 3
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [2,2,1]
=> 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> [2,2,1]
=> 2
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [3,1,1]
=> 2
[1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [3,1,1]
=> 2
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [1,1,1]
=> 1
[1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> [1,1,1]
=> 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [3,2]
=> 2
[2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [3,2]
=> 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [2,2]
=> 1
[2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [2,2]
=> 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [3]
=> 1
[3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [3]
=> 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> []
=> 0
[5] => [1,1,1,1,1,0,0,0,0,0]
=> []
=> ?
=> ? = 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1]
=> [4,3,2,1]
=> 4
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2,1]
=> [4,3,2,1]
=> 4
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [3,3,2,1]
=> 3
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2,1]
=> [3,3,2,1]
=> 3
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [4,2,2,1]
=> 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [4,2,2,1]
=> 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [2,2,2,1]
=> 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2,1]
=> [2,2,2,1]
=> 2
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [4,3,1,1]
=> 3
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [4,3,1,1]
=> 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [3,3,1,1]
=> 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [3,3,1,1]
=> 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [4,1,1,1]
=> 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [4,1,1,1]
=> 2
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [1,1,1,1]
=> 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2]
=> [4,3,2]
=> 3
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [4,3,2]
=> 3
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [3,3,2]
=> 2
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [3,3,2]
=> 2
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [4,2,2]
=> 2
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [4,2,2]
=> 2
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [2,2,2]
=> 1
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [2,2,2]
=> 1
[6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ?
=> ? = 1
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1]
=> [5,4,3,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,2,1]
=> [5,4,3,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> [4,4,3,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [4,4,4,3,2,1]
=> [4,4,3,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> [5,3,3,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> [5,3,3,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> [5,4,2,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> [5,4,2,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> [4,4,2,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,4,4,2,2,1]
=> [4,4,2,2,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> [5,4,3,1,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> [5,4,3,1,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> [4,4,3,1,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [4,4,4,3,1,1]
=> [4,4,3,1,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> [5,3,3,1,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,1,1]
=> [5,3,3,1,1]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2]
=> [5,4,3,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,2]
=> [5,4,3,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2]
=> [4,4,3,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0]
=> [4,4,4,3,2]
=> [4,4,3,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2]
=> [5,3,3,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2]
=> [5,3,3,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2]
=> [5,4,2,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2]
=> [5,4,2,2]
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
[7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> []
=> ?
=> ? ∊ {1,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5}
Description
The number of distinct parts of the integer partition. This statistic is also the number of removeable cells of the partition, and the number of valleys of the Dyck path tracing the shape of the partition.
The following 28 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000444The length of the maximal rise of a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000993The multiplicity of the largest part of an integer partition. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000340The number of non-final maximal constant sub-paths of length greater than one. St001271The competition number of a graph. St000460The hook length of the last cell along the main diagonal of an integer partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000120The number of left tunnels of a Dyck path. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000741The Colin de Verdière graph invariant. St000681The Grundy value of Chomp on Ferrers diagrams. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001118The acyclic chromatic index of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St000668The least common multiple of the parts of the partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000770The major index of an integer partition when read from bottom to top. St000937The number of positive values of the symmetric group character corresponding to the partition. St001568The smallest positive integer that does not appear twice in the partition. St001060The distinguishing index of a graph. St000455The second largest eigenvalue of a graph if it is integral. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St000735The last entry on the main diagonal of a standard tableau.