searching the database
Your data matches 183 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: St001009
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
St001009: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[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 - 1
[1,0,1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[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,0,1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> 2 = 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]
=> 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> 1 = 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 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> 2 = 3 - 1
Description
Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000439
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 2
[1,0,1,0]
=> [1,0,1,0]
=> 2
[1,1,0,0]
=> [1,1,0,0]
=> 3
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 3
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 4
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,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,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
Description
The position of the first down step of a Dyck path.
Matching statistic: St000025
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,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,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,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,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,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,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,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,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
Description
The number of initial rises of a Dyck path.
In other words, this is the height of the first peak of $D$.
Matching statistic: St000026
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,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,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,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,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,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,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,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,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
Description
The position of the first return of a Dyck path.
Matching statistic: St001619
Values
[1,0]
=> ([],1)
=> ([],1)
=> 2
[1,0,1,0]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 3
[1,1,0,0]
=> ([],2)
=> ([],1)
=> 2
[1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 4
[1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 2
[1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> ([],1)
=> 2
[1,1,0,1,0,0]
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 3
[1,1,1,0,0,0]
=> ([],3)
=> ([],1)
=> 2
[1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 5
[1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> ([],1)
=> 2
[1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([],1)
=> 2
[1,0,1,1,0,1,0,0]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 3
[1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 2
[1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> ([],1)
=> 2
[1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 3
[1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> ([(0,1)],2)
=> 3
[1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3)],4)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> ([],1)
=> 2
[1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> ([],1)
=> 2
[1,1,1,0,0,1,0,0]
=> ([(1,2),(1,3)],4)
=> ([],1)
=> 2
[1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> ([(0,1)],2)
=> 3
[1,1,1,1,0,0,0,0]
=> ([],4)
=> ([],1)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([],1)
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([],1)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> ([],1)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([],1)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> ([],1)
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> ([],1)
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(2,1),(3,2)],4)
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(3,4)],5)
=> ([],1)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 2
Description
The number of non-isomorphic sublattices of a lattice.
Matching statistic: St001666
Values
[1,0]
=> ([],1)
=> ([],1)
=> 2
[1,0,1,0]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 3
[1,1,0,0]
=> ([],2)
=> ([],1)
=> 2
[1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 4
[1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> ([],1)
=> 2
[1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> ([],1)
=> 2
[1,1,0,1,0,0]
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 3
[1,1,1,0,0,0]
=> ([],3)
=> ([],1)
=> 2
[1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 5
[1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> ([],1)
=> 2
[1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([],1)
=> 2
[1,0,1,1,0,1,0,0]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 3
[1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 2
[1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> ([],1)
=> 2
[1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 3
[1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> ([(0,1)],2)
=> 3
[1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3)],4)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> ([],1)
=> 2
[1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> ([],1)
=> 2
[1,1,1,0,0,1,0,0]
=> ([(1,2),(1,3)],4)
=> ([],1)
=> 2
[1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> ([(0,1)],2)
=> 3
[1,1,1,1,0,0,0,0]
=> ([],4)
=> ([],1)
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([],1)
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([],1)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> ([],1)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([],1)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> ([],1)
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> ([],1)
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> ([(0,3),(2,1),(3,2)],4)
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([],1)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([],1)
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(3,4)],5)
=> ([],1)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 2
Description
The number of non-isomorphic subposets of a lattice which are lattices.
Matching statistic: St000011
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
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: St000069
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000069: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000069: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,0,0]
=> ([],2)
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> ([],3)
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> ([],4)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
Description
The number of maximal elements of a poset.
Matching statistic: St000382
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1] => 1 = 2 - 1
[1,1,0,0]
=> [1,1,0,0]
=> [2] => 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3] => 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 1 = 2 - 1
Description
The first part of an integer composition.
Matching statistic: St000505
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000505: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000505: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> {{1}}
=> 1 = 2 - 1
[1,0,1,0]
=> [1,0,1,0]
=> {{1},{2}}
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,0,0]
=> {{1,2}}
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> {{1},{2,3}}
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> {{1,2},{3}}
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> {{1},{2,3}}
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> {{1,2,3}}
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 3 = 4 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 1 = 2 - 1
Description
The biggest entry in the block containing the 1.
The following 173 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000971The smallest closer of a set partition. St001616The number of neutral elements in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001622The number of join-irreducible elements of a lattice. St000738The first entry in the last row of a standard tableau. St000068The number of minimal elements in a poset. St000326The position of the first one in a binary word after appending a 1 at the end. St000363The number of minimal vertex covers of a graph. St000383The last part of an integer composition. St000700The protection number of an ordered tree. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000759The smallest missing part in an integer partition. St001050The number of terminal closers of a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001733The number of weak left to right maxima of a Dyck path. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St000008The major index of the composition. St000234The number of global ascents of a permutation. St001777The number of weak descents in an integer composition. St000504The cardinality of the first block of a set partition. St000678The number of up steps after the last double rise of a Dyck path. St000823The number of unsplittable factors of the set partition. St000675The number of centered multitunnels of a Dyck path. St000297The number of leading ones in a binary word. St000502The number of successions of a set partitions. St000909The number of maximal chains of maximal size in a poset. St000911The number of maximal antichains of maximal size in a poset. St000054The first entry of the permutation. St000617The number of global maxima of a Dyck path. St000989The number of final rises of a permutation. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000501The size of the first part in the decomposition of a permutation. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. 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$. St000993The multiplicity of the largest part of an integer partition. St000542The number of left-to-right-minima of a permutation. St000990The first ascent of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000654The first descent of a permutation. St000740The last entry of a permutation. St000883The number of longest increasing subsequences of a permutation. 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$. 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$. St000214The number of adjacencies of a permutation. St001060The distinguishing index of a graph. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. 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. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001461The number of topologically connected components of the chord diagram of a permutation. St000237The number of small exceedances. St000717The number of ordinal summands of a poset. St000203The number of external nodes of a binary tree. St000007The number of saliances of the permutation. St000546The number of global descents of a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001933The largest multiplicity of a part in an integer partition. St001875The number of simple modules with projective dimension at most 1. St000680The Grundy value for Hackendot on posets. St000906The length of the shortest maximal chain in a poset. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000474Dyson's crank of a partition. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. 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. St001279The sum of the parts of an integer partition that are at least two. St001360The number of covering relations in Young's lattice below a partition. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000843The decomposition number of a perfect matching. St001330The hat guessing number of a graph. St000734The last entry in the first row of a standard tableau. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St000335The difference of lower and upper interactions. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000051The size of the left subtree of a binary tree. St000056The decomposition (or block) number of a permutation. St000084The number of subtrees. St000314The number of left-to-right-maxima of a permutation. St000352The Elizalde-Pak rank of a permutation. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001481The minimal height of a peak of a Dyck path. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000061The number of nodes on the left branch of a binary tree. St001432The order dimension of the partition. St000264The girth of a graph, which is not a tree. St001545The second Elser number of a connected graph. St000260The radius of a connected graph. St000259The diameter of a connected graph. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St000731The number of double exceedences of a permutation. St000022The number of fixed points of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000441The number of successions of a permutation. St001130The number of two successive successions in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000657The smallest part of an integer composition. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000338The number of pixed points 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. St001552The number of inversions between excedances and fixed points of a permutation. St000060The greater neighbor of the maximum. St000133The "bounce" of a permutation. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000756The sum of the positions of the left to right maxima of a permutation. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000241The number of cyclical small excedances. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000932The number of occurrences of the pattern UDU in a Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001948The number of augmented double ascents of a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St000895The number of ones on the main diagonal of an alternating sign matrix. St001964The interval resolution global dimension of a poset. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001846The number of elements which do not have a complement in the lattice. St000741The Colin de Verdière graph invariant. St001889The size of the connectivity set of a signed permutation. St000649The number of 3-excedences of a permutation. St000877The depth of the binary word interpreted as a path. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001820The size of the image of the pop stack sorting operator. St001267The length of the Lyndon factorization of the binary word. St000392The length of the longest run of ones in a binary word. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000982The length of the longest constant subword. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St000117The number of centered tunnels of a Dyck path. St000454The largest eigenvalue of a graph if it is integral. St000800The number of occurrences of the vincular pattern |231 in a permutation. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001413Half the length of the longest even length palindromic prefix of a binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function. St000894The trace of an alternating sign matrix. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001811The Castelnuovo-Mumford regularity of a permutation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000655The length of the minimal rise of a Dyck path.
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!