searching the database
Your data matches 122 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000658
(load all 32 compositions to match this statistic)
(load all 32 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[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,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[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,0,1,0]
=> 0 = 1 - 1
[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,0,1,1,0,0]
=> 1 = 2 - 1
[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,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[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,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[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,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[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,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[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,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> 1 = 2 - 1
Description
The number of rises of length 2 of a Dyck path.
This is also the number of $(1,1)$ steps of the associated Łukasiewicz path, see [1].
A related statistic is the number of double rises in a Dyck path, [[St000024]].
Matching statistic: St001125
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001125: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001125: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
Description
The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra.
Matching statistic: St001276
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
Description
The number of 2-regular indecomposable modules in the corresponding Nakayama algebra.
Generalising the notion of k-regular modules from simple to arbitrary indecomposable modules, we call an indecomposable module $M$ over an algebra $A$ k-regular in case it has projective dimension k and $Ext_A^i(M,A)=0$ for $i \neq k$ and $Ext_A^k(M,A)$ is 1-dimensional.
The number of Dyck paths where the statistic returns 0 might be given by [[OEIS:A035929]] .
Matching statistic: St001657
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St001657: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00108: Permutations —cycle type⟶ Integer partitions
St001657: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,2] => [1,1]
=> 0 = 1 - 1
[1,1,0,0]
=> [2,1] => [2]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [3]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [2,1]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,1,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,1,1]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,1]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,1,1]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [2,2]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,1,1,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,1,1,1]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,1,1,1]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [2,1,1,1]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,1,1,1]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [2,1,1,1]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [3,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [2,1,1,1]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [2,2,1]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,1,1]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,2,1]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,2,1]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,2,1]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,1]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [3,2]
=> 1 = 2 - 1
Description
The number of twos in an integer partition.
The total number of twos in all partitions of $n$ is equal to the total number of singletons [[St001484]] in all partitions of $n-1$, see [1].
Matching statistic: St000011
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00228: Dyck paths —reflect parallelogram polyomino⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00228: Dyck paths —reflect parallelogram polyomino⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [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
[1,0,1,0,1,0,1,1,0,0]
=> [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,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,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]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,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]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,0,1,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]
=> 2
[1,1,0,1,0,1,0,1,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]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St001067
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001067: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001067: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0 = 1 - 1
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001189
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
Description
The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001139
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001139: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001139: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> ? = 1 - 1
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,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,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 0 = 1 - 1
Description
The number of occurrences of hills of size 2 in a Dyck path.
A hill of size two is a subpath beginning at height zero, consisting of two up steps followed by two down steps.
Matching statistic: St000683
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000683: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000683: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> ? = 1 - 1
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
Description
The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps.
Matching statistic: St000932
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000932: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000932: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> ? = 1 - 1
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [4,1,5,2,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
Description
The number of occurrences of the pattern UDU in a Dyck path.
The number of Dyck paths with statistic value 0 are counted by the Motzkin numbers [1].
The following 112 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000502The number of successions of a set partitions. St001479The number of bridges of a graph. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001061The number of indices that are both descents and recoils of a permutation. St000884The number of isolated descents of a permutation. St001484The number of singletons of an integer partition. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000260The radius of a connected graph. St001461The number of topologically connected components of the chord diagram of a permutation. St000542The number of left-to-right-minima of a permutation. St000214The number of adjacencies of a permutation. St000237The number of small exceedances. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000744The length of the path to the largest entry in a standard Young tableau. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001280The number of parts of an integer partition that are at least two. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001432The order dimension of the partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001933The largest multiplicity of a part in an integer partition. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001571The Cartan determinant of the integer partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000474Dyson's crank of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000667The greatest common divisor of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000770The major index of an integer partition when read from bottom to top. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001279The sum of the parts of an integer partition that are at least two. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000993The multiplicity of the largest part of an integer partition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001274The number of indecomposable injective modules with projective dimension equal to two. St000456The monochromatic index of a connected graph. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. 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$. 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$. 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$. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000781The number of proper colouring schemes of a Ferrers diagram. St001545The second Elser number of a connected graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000648The number of 2-excedences of a permutation. St000454The largest eigenvalue of a graph if it is integral. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St000028The number of stack-sorts needed to sort a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000259The diameter of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001948The number of augmented double ascents of a permutation. St001118The acyclic chromatic index of a graph. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000455The second largest eigenvalue of a graph if it is integral. St001096The size of the overlap set of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000632The jump number of the poset. St000307The number of rowmotion orbits of a poset. St001686The order of promotion on a Gelfand-Tsetlin pattern. St001330The hat guessing number of a graph. St000264The girth of a graph, which is not a tree. St000741The Colin de Verdière graph invariant. St001820The size of the image of the pop stack sorting operator. St001060The distinguishing index of a graph. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. St000640The rank of the largest boolean interval in a poset. St001964The interval resolution global dimension of a poset. St001621The number of atoms of a lattice. St001414Half the length of the longest odd length palindromic prefix of a binary word. St000335The difference of lower and upper interactions. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000317The cycle descent number of a permutation. St000989The number of final rises of a permutation. St001423The number of distinct cubes in a binary word. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001624The breadth of a lattice. St000007The number of saliances of the permutation. St001115The number of even descents of a permutation.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!