searching the database
Your data matches 166 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: St000957
(load all 41 compositions to match this statistic)
(load all 41 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000957: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000957: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [2,1] => 1
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => 2
[1,1,1,0,0,0]
=> [3,2,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 3
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 2
Description
The number of Bruhat lower covers of a permutation.
This is, for a permutation $\pi$, the number of permutations $\tau$ with $\operatorname{inv}(\tau) = \operatorname{inv}(\pi) - 1$ such that $\tau*t = \pi$ for a transposition $t$.
This is also the number of occurrences of the boxed pattern $21$: occurrences of the pattern $21$ such that any entry between the two matched entries is either larger or smaller than both of the matched entries.
Matching statistic: St000010
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00027: Dyck paths —to partition⟶ 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,0,0]
=> []
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [2,1]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> 2
Description
The length of the partition.
Matching statistic: St000147
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00027: Dyck paths —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,0,0]
=> []
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [2,1]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [3]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> 2
Description
The largest part of an integer partition.
Matching statistic: St000394
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000394: 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,0,1,0]
=> 0
[1,1,0,0]
=> [2,1] => [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 3
[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,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
[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
[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]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2
[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
[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
[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]
=> 2
[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]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0]
=> 3
[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
[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
[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
[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]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[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]
=> 2
[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]
=> 3
[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]
=> 3
[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]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,1,0,1,0,1,1,0,0,0]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,1,0,1,1,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,1,0,1,1,0,0,1,0,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,1,0,1,1,1,0,0,0,0]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,1,0,1,1,1,0,0,0,0]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St000476
(load all 20 compositions to match this statistic)
(load all 20 compositions to match this statistic)
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000476: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000476: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [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,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [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,1,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [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,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [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,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [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,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
Description
The sum of the semi-lengths of tunnels before a valley of a Dyck path.
For each valley $v$ in a Dyck path $D$ there is a corresponding tunnel, which
is the factor $T_v = s_i\dots s_j$ of $D$ where $s_i$ is the step after the first intersection of $D$ with the line $y = ht(v)$ to the left of $s_j$. This statistic is
$$
\sum_v (j_v-i_v)/2.
$$
Matching statistic: St000987
(load all 31 compositions to match this statistic)
(load all 31 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000987: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St000987: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => ([],2)
=> 0
[1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 3
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 3
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 3
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => ([],5)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => ([(1,4),(2,3),(3,4)],5)
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> 2
Description
The number of positive eigenvalues of the Laplacian matrix of the graph.
This is the number of vertices minus the number of connected components of the graph.
Matching statistic: St000093
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00100: Dyck paths —touch composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> 1 = 0 + 1
[1,1,0,0]
=> [2] => ([],2)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [3] => ([],3)
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [3] => ([],3)
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
Description
The cardinality of a maximal independent set of vertices of a graph.
An independent set of a graph is a set of pairwise non-adjacent vertices. A maximum independent set is an independent set of maximum cardinality. This statistic is also called the independence number or stability number $\alpha(G)$ of $G$.
Matching statistic: St000786
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00100: Dyck paths —touch composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000786: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000786: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> 1 = 0 + 1
[1,1,0,0]
=> [2] => ([],2)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [3] => ([],3)
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [3] => ([],3)
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [5] => ([],5)
=> 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
Description
The maximal number of occurrences of a colour in a proper colouring of a graph.
To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the largest part occurring in any of these partitions.
For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$. Therefore, the statistic on this graph is $3$.
Matching statistic: St000024
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00066: Permutations —inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000024: 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,2] => [1,0,1,0]
=> 0
[1,1,0,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,5,3,4,2] => [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,5,4,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,1,2,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,1,3,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [5,1,3,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [5,1,3,4,2] => [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,1,4,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2
Description
The number of double up and double down steps of a Dyck path.
In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.
Matching statistic: St000053
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00100: Dyck paths —touch composition⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000053: Dyck paths ⟶ ℤ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,0]
=> 0
[1,1,0,0]
=> [2] => [1,1] => [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => [3] => [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [3] => [1,1,1] => [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [3] => [1,1,1] => [1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
Description
The number of valleys of the Dyck path.
The following 156 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000272The treewidth of a graph. St000288The number of ones in a binary word. St000362The size of a minimal vertex cover of a graph. St000377The dinv defect of an integer partition. St000442The maximal area to the right of an up step of a Dyck path. St000536The pathwidth of a graph. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000691The number of changes of a binary word. St000730The maximal arc length of a set partition. St000874The position of the last double rise in a Dyck path. St001176The size of a partition minus its first part. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001479The number of bridges of a graph. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St000011The number of touch points (or returns) of a Dyck path. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000172The Grundy number of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000444The length of the maximal rise of a Dyck path. St000507The number of ascents of a standard tableau. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000808The number of up steps of the associated bargraph. St000839The largest opener of a set partition. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. 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:
St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001670The connected partition number of a graph. St001809The index of the step at the first peak of maximal height in a Dyck path. St000439The position of the first down step of a Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St000378The diagonal inversion number of an integer partition. St000733The row containing the largest entry of a standard tableau. St000809The reduced reflection length of the permutation. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000740The last entry of a permutation. St001497The position of the largest weak excedence of a permutation. St000306The bounce count of a Dyck path. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St000676The number of odd rises of a Dyck path. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001963The tree-depth of a graph. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000653The last descent of a permutation. St001280The number of parts of an integer partition that are at least two. St000956The maximal displacement of a permutation. St000141The maximum drop size of a permutation. St000054The first entry of the permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000019The cardinality of the support of a permutation. St000081The number of edges of a graph. St000012The area of a Dyck path. St000984The number of boxes below precisely one peak. St000067The inversion number of the alternating sign matrix. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St000246The number of non-inversions of a permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St001480The number of simple summands of the module J^2/J^3. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St000240The number of indices that are not small excedances. St000316The number of non-left-to-right-maxima of a permutation. St000051The size of the left subtree of a binary tree. St000204The number of internal nodes of a binary tree. St000216The absolute length of a permutation. St000304The load of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000356The number of occurrences of the pattern 13-2. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001869The maximum cut size of a graph. St000015The number of peaks of a Dyck path. St000443The number of long tunnels of a Dyck path. St000822The Hadwiger number of the graph. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001202Call 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 special CNakayama algebra. 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. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. 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. St000692Babson and Steingrímsson's statistic of a permutation. St001674The number of vertices of the largest induced star graph in the graph. St001323The independence gap of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St001330The hat guessing number of a graph. St001812The biclique partition number of a graph. St001082The number of boxed occurrences of 123 in a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000028The number of stack-sorts needed to sort a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000840The number of closers smaller than the largest opener in a perfect matching. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000327The number of cover relations in a poset. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. 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. St000133The "bounce" of a permutation. St001115The number of even descents of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000060The greater neighbor of the maximum. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000235The number of indices that are not cyclical small weak excedances. St000299The number of nonisomorphic vertex-induced subtrees. St000673The number of non-fixed points of a permutation. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000080The rank of the poset. St000528The height of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001782The order of rowmotion on the set of order ideals of a poset. St000906The length of the shortest maximal chain in a poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001861The number of Bruhat lower covers of a permutation. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001645The pebbling number of a connected graph. St001394The genus of a permutation. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001877Number of indecomposable injective modules with projective dimension 2. St000005The bounce statistic of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. 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)$. St001557The number of inversions of the second entry of a permutation. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St000742The number of big ascents of a permutation after prepending zero.
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!