searching the database
Your data matches 65 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: St000444
(load all 33 compositions to match this statistic)
(load all 33 compositions to match this statistic)
St000444: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> 1
[1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> 3
Description
The length of the maximal rise of a Dyck path.
Matching statistic: St000381
(load all 38 compositions to match this statistic)
(load all 38 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => 1
[1,1,0,0]
=> [2] => 2
[1,0,1,0,1,0]
=> [1,1,1] => 1
[1,0,1,1,0,0]
=> [1,2] => 2
[1,1,0,0,1,0]
=> [2,1] => 2
[1,1,0,1,0,0]
=> [2,1] => 2
[1,1,1,0,0,0]
=> [3] => 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => 2
[1,0,1,1,1,0,0,0]
=> [1,3] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 2
[1,1,0,0,1,1,0,0]
=> [2,2] => 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,2] => 2
[1,1,1,0,0,0,1,0]
=> [3,1] => 3
[1,1,1,0,0,1,0,0]
=> [3,1] => 3
[1,1,1,0,1,0,0,0]
=> [3,1] => 3
[1,1,1,1,0,0,0,0]
=> [4] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 3
Description
The largest part of an integer composition.
Matching statistic: St000147
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,1]
=> 1
[1,1,0,0]
=> [2] => [2]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [2,1]
=> 2
[1,1,0,0,1,0]
=> [2,1] => [2,1]
=> 2
[1,1,0,1,0,0]
=> [2,1] => [2,1]
=> 2
[1,1,1,0,0,0]
=> [3] => [3]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,1,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [2,1,1]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [2,1,1]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => [2,2]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,1] => [3,1]
=> 3
[1,1,1,0,1,0,0,0]
=> [3,1] => [3,1]
=> 3
[1,1,1,1,0,0,0,0]
=> [4] => [4]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [2,1,1,1]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,1,1,1]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [2,1,1,1]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [3,1,1]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [3,1,1]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [2,1,1,1]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,2,1]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> 3
Description
The largest part of an integer partition.
Matching statistic: St000442
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000442: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000442: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[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]
=> 2 = 3 - 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]
=> 2 = 3 - 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]
=> 1 = 2 - 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]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 3 = 4 - 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]
=> 2 = 3 - 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]
=> 1 = 2 - 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]
=> 1 = 2 - 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]
=> 3 = 4 - 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]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 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]
=> 1 = 2 - 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]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 3 - 1
Description
The maximal area to the right of an up step of a Dyck path.
Matching statistic: St000010
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,1]
=> [2]
=> 1
[1,1,0,0]
=> [2] => [2]
=> [1,1]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> [3]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [2,1]
=> [2,1]
=> 2
[1,1,0,0,1,0]
=> [2,1] => [2,1]
=> [2,1]
=> 2
[1,1,0,1,0,0]
=> [2,1] => [2,1]
=> [2,1]
=> 2
[1,1,1,0,0,0]
=> [3] => [3]
=> [1,1,1]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> [4]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> [3,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> [3,1]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,1,1]
=> [3,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> [2,1,1]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> [3,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> [2,2]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [2,1,1]
=> [3,1]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [2,1,1]
=> [3,1]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => [2,2]
=> [2,2]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> [2,1,1]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,1] => [3,1]
=> [2,1,1]
=> 3
[1,1,1,0,1,0,0,0]
=> [3,1] => [3,1]
=> [2,1,1]
=> 3
[1,1,1,1,0,0,0,0]
=> [4] => [4]
=> [1,1,1,1]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,1,1,1,1]
=> [5]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [2,1,1,1]
=> [4,1]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> [3,1,1]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> [3,2]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1]
=> [3,2]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> [3,1,1]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [3,1,1]
=> [3,1,1]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [3,1,1]
=> [3,1,1]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> [2,1,1,1]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> [2,2,1]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [2,1,1,1]
=> [4,1]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1]
=> [3,2]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2]
=> [2,2,1]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> [3,1,1]
=> 3
Description
The length of the partition.
Matching statistic: St000734
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St000734: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St000734: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,1]
=> [[1],[2]]
=> 1
[1,1,0,0]
=> [2] => [2]
=> [[1,2]]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> [[1],[2],[3]]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [2,1]
=> [[1,2],[3]]
=> 2
[1,1,0,0,1,0]
=> [2,1] => [2,1]
=> [[1,2],[3]]
=> 2
[1,1,0,1,0,0]
=> [2,1] => [2,1]
=> [[1,2],[3]]
=> 2
[1,1,1,0,0,0]
=> [3] => [3]
=> [[1,2,3]]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> [[1],[2],[3],[4]]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> [[1,2],[3],[4]]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> [[1,2],[3],[4]]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,1,1]
=> [[1,2],[3],[4]]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> [[1,2,3],[4]]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> [[1,2],[3],[4]]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> [[1,2],[3,4]]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [2,1,1]
=> [[1,2],[3],[4]]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [2,1,1]
=> [[1,2],[3],[4]]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => [2,2]
=> [[1,2],[3,4]]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> [[1,2,3],[4]]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,1] => [3,1]
=> [[1,2,3],[4]]
=> 3
[1,1,1,0,1,0,0,0]
=> [3,1] => [3,1]
=> [[1,2,3],[4]]
=> 3
[1,1,1,1,0,0,0,0]
=> [4] => [4]
=> [[1,2,3,4]]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> [[1,2,3],[4],[5]]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> [[1,2,3],[4],[5]]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [3,1,1]
=> [[1,2,3],[4],[5]]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [3,1,1]
=> [[1,2,3],[4],[5]]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> [[1,2,3,4],[5]]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> [[1,2,3],[4,5]]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1]
=> [[1,2],[3,4],[5]]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2]
=> [[1,2,3],[4,5]]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> [[1,2,3],[4],[5]]
=> 3
Description
The last entry in the first row of a standard tableau.
Matching statistic: St000983
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
Mp00268: Binary words —zeros to flag zeros⟶ Binary words
St000983: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00094: Integer compositions —to binary word⟶ Binary words
Mp00268: Binary words —zeros to flag zeros⟶ Binary words
St000983: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => 11 => 11 => 1
[1,1,0,0]
=> [2] => 10 => 01 => 2
[1,0,1,0,1,0]
=> [1,1,1] => 111 => 111 => 1
[1,0,1,1,0,0]
=> [1,2] => 110 => 011 => 2
[1,1,0,0,1,0]
=> [2,1] => 101 => 001 => 2
[1,1,0,1,0,0]
=> [2,1] => 101 => 001 => 2
[1,1,1,0,0,0]
=> [3] => 100 => 101 => 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1111 => 1111 => 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 1110 => 0111 => 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 1101 => 0011 => 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => 1101 => 0011 => 2
[1,0,1,1,1,0,0,0]
=> [1,3] => 1100 => 1011 => 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 1011 => 0001 => 2
[1,1,0,0,1,1,0,0]
=> [2,2] => 1010 => 1001 => 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => 1011 => 0001 => 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => 1011 => 0001 => 2
[1,1,0,1,1,0,0,0]
=> [2,2] => 1010 => 1001 => 2
[1,1,1,0,0,0,1,0]
=> [3,1] => 1001 => 1101 => 3
[1,1,1,0,0,1,0,0]
=> [3,1] => 1001 => 1101 => 3
[1,1,1,0,1,0,0,0]
=> [3,1] => 1001 => 1101 => 3
[1,1,1,1,0,0,0,0]
=> [4] => 1000 => 0101 => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 11111 => 11111 => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 11110 => 01111 => 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 11101 => 00111 => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => 11101 => 00111 => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 11100 => 10111 => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 11011 => 00011 => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 11010 => 10011 => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => 11011 => 00011 => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => 11011 => 00011 => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => 11010 => 10011 => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 11001 => 11011 => 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => 11001 => 11011 => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => 11001 => 11011 => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 11000 => 01011 => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 10111 => 00001 => 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 10110 => 10001 => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 10101 => 11001 => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => 10101 => 11001 => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 10100 => 01001 => 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => 10111 => 00001 => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => 10110 => 10001 => 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 10111 => 00001 => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 10111 => 00001 => 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 10110 => 10001 => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 10101 => 11001 => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 10101 => 11001 => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 10101 => 11001 => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 10100 => 01001 => 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 10011 => 11101 => 3
Description
The length of the longest alternating subword.
This is the length of the longest consecutive subword of the form $010...$ or of the form $101...$.
Matching statistic: St000392
(load all 22 compositions to match this statistic)
(load all 22 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
St000392: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00094: Integer compositions —to binary word⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
St000392: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => 11 => 00 => 0 = 1 - 1
[1,1,0,0]
=> [2] => 10 => 01 => 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,1] => 111 => 000 => 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,2] => 110 => 001 => 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1] => 101 => 010 => 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,1] => 101 => 010 => 1 = 2 - 1
[1,1,1,0,0,0]
=> [3] => 100 => 011 => 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1111 => 0000 => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 1110 => 0001 => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 1101 => 0010 => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => 1101 => 0010 => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,3] => 1100 => 0011 => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 1011 => 0100 => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2] => 1010 => 0101 => 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => 1011 => 0100 => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => 1011 => 0100 => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [2,2] => 1010 => 0101 => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [3,1] => 1001 => 0110 => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [3,1] => 1001 => 0110 => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [3,1] => 1001 => 0110 => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [4] => 1000 => 0111 => 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 11111 => 00000 => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 11110 => 00001 => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 11101 => 00010 => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => 11101 => 00010 => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 11100 => 00011 => 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 11011 => 00100 => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 11010 => 00101 => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => 11011 => 00100 => 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => 11011 => 00100 => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => 11010 => 00101 => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 11001 => 00110 => 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => 11001 => 00110 => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => 11001 => 00110 => 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 11000 => 00111 => 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 10111 => 01000 => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 10110 => 01001 => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 10101 => 01010 => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => 10101 => 01010 => 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 10100 => 01011 => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => 10111 => 01000 => 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => 10110 => 01001 => 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 10111 => 01000 => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 10111 => 01000 => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 10110 => 01001 => 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 10101 => 01010 => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 10101 => 01010 => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 10101 => 01010 => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 10100 => 01011 => 2 = 3 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 10011 => 01100 => 2 = 3 - 1
Description
The length of the longest run of ones in a binary word.
Matching statistic: St000676
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000676: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000676: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [2] => [2]
=> [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [3] => [3]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,1,1,1,1]
=> [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] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [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] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1] => [1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
Description
The number of odd rises of a Dyck path.
This is the number of ones at an odd position, with the initial position equal to 1.
The number of Dyck paths of semilength $n$ with $k$ up steps in odd positions and $k$ returns to the main diagonal are counted by the binomial coefficient $\binom{n-1}{k-1}$ [3,4].
Matching statistic: St001039
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001039: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001039: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [2] => [2]
=> [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [3] => [3]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,1,1,1,1]
=> [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] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [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] => [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1] => [1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
Description
The maximal height of a column in the parallelogram polyomino associated with a Dyck path.
The following 55 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000521The number of distinct subtrees of an ordered tree. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000013The height of a Dyck path. St000439The position of the first down step of a Dyck path. St001058The breadth of the ordered tree. St001809The index of the step at the first peak of maximal height in a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000306The bounce count of a Dyck path. St001062The maximal size of a block of a set partition. St000503The maximal difference between two elements in a common block. St000025The number of initial rises of a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000451The length of the longest pattern of the form k 1 2. St001090The number of pop-stack-sorts needed to sort a permutation. St000662The staircase size of the code of a permutation. St000485The length of the longest cycle of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St000209Maximum difference of elements in cycles. St000956The maximal displacement of a permutation. St000308The height of the tree associated to a permutation. St000651The maximal size of a rise in a permutation. St000141The maximum drop size of a permutation. St001933The largest multiplicity of a part in an integer partition. St001330The hat guessing number of a graph. St001372The length of a longest cyclic run of ones of a binary word. St000628The balance of a binary word. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000982The length of the longest constant subword. St001046The maximal number of arcs nesting a given arc of a perfect matching. St000846The maximal number of elements covering an element of a poset. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St000328The maximum number of child nodes in a tree. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St000166The depth minus 1 of an ordered tree. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. 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. St001530The depth of a Dyck path. St000094The depth of an ordered tree. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St000326The position of the first one in a binary word after appending a 1 at the end. St000028The number of stack-sorts needed to sort a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001589The nesting number of a perfect matching. St000914The sum of the values of the Möbius function of a poset. St001890The maximum magnitude of the Möbius function of a poset. 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)$. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset.
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!