searching the database
Your data matches 259 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: St000660
(load all 37 compositions to match this statistic)
(load all 37 compositions to match this statistic)
St000660: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 0
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> 1
Description
The number of rises of length at least 3 of a Dyck path.
The number of Dyck paths without such rises are counted by the Motzkin numbers [1].
Matching statistic: St001022
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 0
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 0
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 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
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0
[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
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0
[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
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 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
[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
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 0
Description
Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000052
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 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,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
Description
The number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
Matching statistic: St000196
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00018: Binary trees —left border symmetry⟶ Binary trees
St000196: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00018: Binary trees —left border symmetry⟶ Binary trees
St000196: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [.,.]
=> 0
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [[.,.],.]
=> 0
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [.,[.,.]]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [[.,.],[.,.]]
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [[.,[.,.]],.]
=> 0
[1,1,0,0,1,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [.,[[.,.],.]]
=> 0
[1,1,0,1,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [[.,[.,.]],.]
=> 0
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [.,[.,[.,.]]]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [[.,.],[.,[.,.]]]
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [[.,[.,.]],[.,.]]
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [[.,[[.,.],.]],.]
=> 0
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [[.,[.,.]],[.,.]]
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [[.,[.,[.,.]]],.]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [.,[[.,.],[.,.]]]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [.,[[.,[.,.]],.]]
=> 0
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [[.,[[.,.],.]],.]
=> 0
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [[.,[.,.]],[.,.]]
=> 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [[.,[.,[.,.]]],.]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [.,[.,[[.,.],.]]]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [.,[[.,[.,.]],.]]
=> 0
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [[.,[.,[.,.]]],.]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [.,[.,[.,[.,.]]]]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [[.,.],[.,[.,[.,.]]]]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [[.,[[.,.],.]],[.,.]]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [[.,[[.,.],[.,.]]],.]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [[.,[[.,.],.]],[.,.]]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [[.,[.,[[.,.],.]]],.]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [[.,[.,[.,[.,.]]]],.]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [.,[[.,.],[.,[.,.]]]]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [.,[[.,[.,.]],[.,.]]]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [.,[[.,[[.,.],.]],.]]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [.,[[.,[.,.]],[.,.]]]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [.,[[.,[.,[.,.]]],.]]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> [[.,[[.,.],[.,.]]],.]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [[.,[.,.]],[[.,.],.]]
=> [[.,[[.,.],.]],[.,.]]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [[.,.],[.,[[.,.],.]]]
=> [[.,[.,[[.,.],.]]],.]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [[.,[.,[.,[.,.]]]],.]
=> 0
Description
The number of occurrences of the contiguous pattern {{{[[.,.],[.,.]]}}} in a binary tree.
Equivalently, this is the number of branches in the tree, i.e. the number of nodes with two children. Binary trees avoiding this pattern are counted by $2^{n-2}$.
Matching statistic: St000386
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000386: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000386: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 0
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 0
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
Description
The number of factors DDU in a Dyck path.
Matching statistic: St000201
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00018: Binary trees —left border symmetry⟶ Binary trees
St000201: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00018: Binary trees —left border symmetry⟶ Binary trees
St000201: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [.,.]
=> 1 = 0 + 1
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [[.,.],.]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [.,[.,.]]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [[.,.],[.,.]]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [[.,[.,.]],.]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [.,[[.,.],.]]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [[.,[.,.]],.]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [.,[.,[.,.]]]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [[.,.],[.,[.,.]]]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [[.,[.,.]],[.,.]]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [[.,[[.,.],.]],.]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [[.,[.,.]],[.,.]]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [[.,[.,[.,.]]],.]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [.,[[.,.],[.,.]]]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [.,[[.,[.,.]],.]]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [[.,[[.,.],.]],.]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [[.,[.,.]],[.,.]]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [[.,[.,[.,.]]],.]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [.,[.,[[.,.],.]]]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [.,[[.,[.,.]],.]]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [[.,[.,[.,.]]],.]
=> 1 = 0 + 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [.,[.,[.,[.,.]]]]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [[.,.],[.,[.,[.,.]]]]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [[.,[[.,.],.]],[.,.]]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 2 = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [[.,[[.,.],[.,.]]],.]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [[.,[[.,.],.]],[.,.]]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [[.,[.,[[.,.],.]]],.]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [[.,[.,[.,[.,.]]]],.]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [.,[[.,.],[.,[.,.]]]]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [.,[[.,[.,.]],[.,.]]]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [.,[[.,[[.,.],.]],.]]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [.,[[.,[.,.]],[.,.]]]
=> 2 = 1 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [.,[[.,[.,[.,.]]],.]]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> [[.,[[.,.],[.,.]]],.]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [[.,[.,.]],[[.,.],.]]
=> [[.,[[.,.],.]],[.,.]]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [[.,[.,.]],[.,[.,.]]]
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [[.,.],[.,[[.,.],.]]]
=> [[.,[.,[[.,.],.]]],.]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [[.,.],[[.,.],[.,.]]]
=> [[.,[[.,[.,.]],.]],.]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[.,[.,.]]]
=> [[.,[.,[.,.]]],[.,.]]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [[.,[.,[.,[.,.]]]],.]
=> 1 = 0 + 1
Description
The number of leaf nodes in a binary tree.
Equivalently, the number of cherries [1] in the complete binary tree.
The number of binary trees of size $n$, at least $1$, with exactly one leaf node for is $2^{n-1}$, see [2].
The number of binary tree of size $n$, at least $3$, with exactly two leaf nodes is $n(n+1)2^{n-2}$, see [3].
Matching statistic: St000552
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000552: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000552: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => ([],2)
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => ([(0,1)],2)
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => ([(1,2)],3)
=> 0
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(2,3)],4)
=> 0
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => ([(2,3)],4)
=> 0
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 0
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(2,3)],4)
=> 0
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 0
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => ([],5)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ?
=> ? = 1
Description
The number of cut vertices of a graph.
A cut vertex is one whose deletion increases the number of connected components.
Matching statistic: St001335
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001335: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001335: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => ([],2)
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => ([(0,1)],2)
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => ([(1,2)],3)
=> 0
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,1,0,0,0]
=> [[0,0,1],[0,1,0],[1,0,0]]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(2,3)],4)
=> 0
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => ([(2,3)],4)
=> 0
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 0
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(2,3)],4)
=> 0
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 0
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => ([],5)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,0,1,-1,1],[0,0,0,1,-1,1,0],[0,0,0,0,1,0,0]]
=> ? => ?
=> ? = 1
Description
The cardinality of a minimal cycle-isolating set of a graph.
Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$.
This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains all cycles.
Matching statistic: St001689
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001689: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001689: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => ([],2)
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => ([(0,1)],2)
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => ([(1,2)],3)
=> 0
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => ([(1,2)],3)
=> 0
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(2,3)],4)
=> 0
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => ([(2,3)],4)
=> 0
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 0
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(2,3)],4)
=> 0
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(2,3)],4)
=> 0
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 0
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => ([],5)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ?
=> ? = 1
Description
The number of celebrities in a graph.
A celebrity is a vertex such that more than half of its neighbours have smaller degree.
Matching statistic: St001839
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St001839: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St001839: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => {{1}}
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => {{1},{2}}
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => {{1,2}}
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => {{1},{2,3}}
=> 0
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => {{1,3},{2}}
=> 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 0
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 0
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 0
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => {{1,3},{2},{4}}
=> 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 0
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => {{1,4},{2},{3}}
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => {{1},{2,5},{3},{4}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => {{1,2},{3,5},{4}}
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => {{1},{2,5},{3},{4}}
=> 1
[1,1,0,0,1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,-1,1],[0,0,0,0,1,0,0],[0,0,0,0,0,1,0]]
=> ? => ?
=> ? = 1
Description
The number of excedances of a set partition.
The Mahonian representation of a set partition $\{B_1,\dots,B_k\}$ of $\{1,\dots,n\}$ is the restricted growth word $w_1 \dots w_n$ obtained by sorting the blocks of the set partition according to their maximal element, and setting $w_i$ to the index of the block containing $i$.
Let $\bar w$ be the nondecreasing rearrangement of $w$.
The word $w$ has an excedance at position $i$ if $w_i > \bar w_i$.
The following 249 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001840The number of descents of a set partition. St000374The number of exclusive right-to-left minima of a permutation. St000670The reversal length of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001469The holeyness of a permutation. St001737The number of descents of type 2 in a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St000647The number of big descents of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000710The number of big deficiencies of a permutation. St000779The tier of a permutation. St000836The number of descents of distance 2 of a permutation. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000360The number of occurrences of the pattern 32-1. St001728The number of invisible descents of a permutation. St000711The number of big exceedences of a permutation. St000257The number of distinct parts of a partition that occur at least twice. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000035The number of left outer peaks of a permutation. St001204Call 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. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St000159The number of distinct parts of the integer partition. St000183The side length of the Durfee square of an integer partition. St000340The number of non-final maximal constant sub-paths of length greater than one. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000783The side length of the largest staircase partition fitting into a partition. St000897The number of different multiplicities of parts of an integer partition. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St000781The number of proper colouring schemes of a Ferrers diagram. St000137The Grundy value of an integer partition. St000356The number of occurrences of the pattern 13-2. St000938The number of zeros of the symmetric group character corresponding to the partition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St000353The number of inner valleys of a permutation. St000929The constant term of the character polynomial of an integer partition. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001139The number of occurrences of hills of size 2 in a Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001587Half of the largest even part of an integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000260The radius of a connected graph. St001568The smallest positive integer that does not appear twice in the partition. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000914The sum of the values of the Möbius function of a poset. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000618The number of self-evacuating tableaux of given shape. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000944The 3-degree of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001128The exponens consonantiae of a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001280The number of parts of an integer partition that are at least two. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001383The BG-rank of an integer partition. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001657The number of twos in an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001890The maximum magnitude of the Möbius function of a poset. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St000632The jump number of the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000125The number of occurrences of the contiguous pattern [.,[[[.,.],.],. St000023The number of inner peaks of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000663The number of right floats of a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000646The number of big ascents of a permutation. St000837The number of ascents of distance 2 of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000307The number of rowmotion orbits of a poset. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St000544The cop number of a graph. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St001175The size of a partition minus the hook length of the base cell. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St000454The largest eigenvalue of a graph if it is integral. St000455The second largest eigenvalue of a graph if it is integral. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St000100The number of linear extensions of a poset. St001330The hat guessing number of a graph. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000640The rank of the largest boolean interval in a poset. St000649The number of 3-excedences of a permutation. St000940The number of characters of the symmetric group whose value on the partition is zero. St001403The number of vertical separators in a permutation. St001470The cyclic holeyness of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001665The number of pure excedances of a permutation. St000366The number of double descents of a permutation. St000664The number of right ropes of a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001820The size of the image of the pop stack sorting operator. St001875The number of simple modules with projective dimension at most 1. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000022The number of fixed points of a permutation. St000534The number of 2-rises of a permutation. St000850The number of 1/2-balanced pairs in a poset. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St001624The breadth of a lattice. St001570The minimal number of edges to add to make a graph Hamiltonian. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St000731The number of double exceedences of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St000028The number of stack-sorts needed to sort a permutation. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St000451The length of the longest pattern of the form k 1 2. St001520The number of strict 3-descents. St001960The number of descents of a permutation minus one if its first entry is not one. St000527The width of the poset. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000908The length of the shortest maximal antichain in a poset. St001399The distinguishing number of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001597The Frobenius rank of a skew partition. St001095The number of non-isomorphic posets with precisely one further covering relation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. 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$. St001964The interval resolution global dimension of a poset. St000181The number of connected components of the Hasse diagram for the poset. St000068The number of minimal elements in a poset. St001846The number of elements which do not have a complement in the lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001720The minimal length of a chain of small intervals in a lattice. St000741The Colin de Verdière graph invariant. St000764The number of strong records in an integer composition. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St001397Number of pairs of incomparable elements in a finite poset. St000633The size of the automorphism group of a poset. 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. St001268The size of the largest ordinal summand in the poset. St001779The order of promotion on the set of linear extensions of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000058The order of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001862The number of crossings of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001487The number of inner corners of a skew partition. St000732The number of double deficiencies of a permutation. St000989The number of final rises of a permutation. St001513The number of nested exceedences of a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000884The number of isolated descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St001535The number of cyclic alignments of a permutation. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001096The size of the overlap set of a permutation. St000768The number of peaks in an integer composition. St000920The logarithmic height of a Dyck path. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St000761The number of ascents in an integer composition. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001061The number of indices that are both descents and recoils of a permutation. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001394The genus of a permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001549The number of restricted non-inversions between exceedances. St001811The Castelnuovo-Mumford regularity of a permutation. St001948The number of augmented double ascents 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. St000669The number of permutations obtained by switching ascents or descents of size 2. St000765The number of weak records in an integer composition. St000805The number of peaks of the associated bargraph. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. 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. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001729The number of visible descents of a permutation. St001732The number of peaks visible from the left. St001928The number of non-overlapping descents in a permutation. St000542The number of left-to-right-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. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000237The number of small exceedances. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000883The number of longest increasing subsequences of a permutation.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!