searching the database
Your data matches 113 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: St001022
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ 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]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 1
Description
Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000451
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
St000451: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
St000451: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 1 = 0 + 1
[1,0,1,0]
=> [2,1] => [2,1] => [2,1] => 2 = 1 + 1
[1,1,0,0]
=> [1,2] => [1,2] => [1,2] => 1 = 0 + 1
[1,0,1,0,1,0]
=> [2,3,1] => [3,1,2] => [2,3,1] => 2 = 1 + 1
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [1,3,2] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,2,1] => [3,2,1] => 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,1,2,3] => [2,3,4,1] => 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,1,2,4] => [2,3,1,4] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,3,1,2] => [3,4,2,1] => 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,2,3] => [1,3,4,2] => 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,2,1,3] => [3,2,4,1] => 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [3,1,4,2] => [2,4,1,3] => 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,2,1,4] => [3,2,1,4] => 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,3,2] => [1,4,3,2] => 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,3,2,1] => [4,3,2,1] => 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [2,3,4,5,1] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [2,3,4,1,5] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => [2,3,1,5,4] => 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,4,1,2,3] => [3,4,5,2,1] => 2 = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => [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,5,3,4] => [2,1,4,5,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,3,1,2,4] => [3,4,2,5,1] => 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [4,1,2,5,3] => [2,3,5,1,4] => 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,3,1,2,5] => [3,4,2,1,5] => 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,4,3] => [2,1,5,4,3] => 2 = 1 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,4,3,1,2] => [4,5,3,2,1] => 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => [1,3,4,5,2] => 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => [1,3,4,2,5] => 2 = 1 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,4,2,3] => [1,4,5,3,2] => 2 = 1 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,2,1,3,4] => [3,2,4,5,1] => 2 = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,2,1,3,5] => [3,2,4,1,5] => 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [3,1,5,2,4] => [2,4,1,5,3] => 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,2,4,1,3] => [4,2,5,3,1] => 3 = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [3,1,4,2,5] => [2,4,1,3,5] => 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => 2 = 1 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,4,2,1,3] => [4,3,5,2,1] => 2 = 1 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [3,1,5,4,2] => [2,5,1,4,3] => 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => 2 = 1 + 1
Description
The length of the longest pattern of the form k 1 2...(k-1).
Matching statistic: St001761
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St001761: Permutations ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
St001761: Permutations ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [2,1] => 1
[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] => 1
[1,1,0,0,1,0]
=> [1,3,2] => 1
[1,1,0,1,0,0]
=> [3,1,2] => 1
[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] => 1
[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] => 1
[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] => 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => 1
[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] => 1
[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] => 2
[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] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => 1
[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] => 1
[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] => 1
[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] => 1
[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] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => 1
[]
=> [] => ? = 0
Description
The maximal multiplicity of a letter in a reduced word of a permutation.
For example, the permutation $3421$ has the reduced word $s_2 s_1 s_2 s_3 s_2$, where $s_2$ appears three times.
Matching statistic: St001277
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001277: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St001277: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,2] => ([],2)
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => ([(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => ([(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> 1
[]
=> [] => ([],0)
=> ? = 0
Description
The degeneracy of a graph.
The degeneracy of a graph $G$ is the maximum of the minimum degrees of the (vertex induced) subgraphs of $G$.
Matching statistic: St001358
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001358: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St001358: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,2] => ([],2)
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => ([(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => ([(1,4),(2,3),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> 1
[]
=> [] => ([],0)
=> ? = 0
Description
The largest degree of a regular subgraph of a graph.
For $k > 2$, it is an NP-complete problem to determine whether a graph has a $k$-regular subgraph, see [1].
Matching statistic: St000254
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00221: Set partitions —conjugate⟶ Set partitions
St000254: Set partitions ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00221: Set partitions —conjugate⟶ Set partitions
St000254: Set partitions ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => {{1,2}}
=> {{1},{2}}
=> 0
[1,0,1,0]
=> [3,1,2] => {{1,3},{2}}
=> {{1},{2,3}}
=> 1
[1,1,0,0]
=> [2,3,1] => {{1,2,3}}
=> {{1},{2},{3}}
=> 0
[1,0,1,0,1,0]
=> [4,1,2,3] => {{1,4},{2},{3}}
=> {{1},{2,3,4}}
=> 1
[1,0,1,1,0,0]
=> [3,1,4,2] => {{1,3,4},{2}}
=> {{1},{2},{3,4}}
=> 1
[1,1,0,0,1,0]
=> [2,4,1,3] => {{1,2,4},{3}}
=> {{1},{2,3},{4}}
=> 1
[1,1,0,1,0,0]
=> [4,3,1,2] => {{1,4},{2,3}}
=> {{1},{2,4},{3}}
=> 1
[1,1,1,0,0,0]
=> [2,3,4,1] => {{1,2,3,4}}
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => {{1,5},{2},{3},{4}}
=> {{1},{2,3,4,5}}
=> 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => {{1,4,5},{2},{3}}
=> {{1},{2},{3,4,5}}
=> 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => {{1,3,5},{2},{4}}
=> {{1},{2,3},{4,5}}
=> 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => {{1,5},{2},{3,4}}
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => {{1,3,4,5},{2}}
=> {{1},{2},{3},{4,5}}
=> 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => {{1,2,5},{3},{4}}
=> {{1},{2,3,4},{5}}
=> 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => {{1,2,4,5},{3}}
=> {{1},{2},{3,4},{5}}
=> 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => {{1,5},{2,3},{4}}
=> {{1},{2,3,5},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => {{1,5},{2,4},{3}}
=> {{1},{2,5},{3,4}}
=> 2
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => {{1,4,5},{2,3}}
=> {{1},{2},{3,5},{4}}
=> 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => {{1,2,3,5},{4}}
=> {{1},{2,3},{4},{5}}
=> 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => {{1,2,5},{3,4}}
=> {{1},{2,4},{3},{5}}
=> 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => {{1,5},{2,3,4}}
=> {{1},{2,5},{3},{4}}
=> 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => {{1,2,3,4,5}}
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => {{1,6},{2},{3},{4},{5}}
=> {{1},{2,3,4,5,6}}
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => {{1,5,6},{2},{3},{4}}
=> {{1},{2},{3,4,5,6}}
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => {{1,4,6},{2},{3},{5}}
=> {{1},{2,3},{4,5,6}}
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => {{1,6},{2},{3},{4,5}}
=> {{1},{2,4,5,6},{3}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => {{1,4,5,6},{2},{3}}
=> {{1},{2},{3},{4,5,6}}
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => {{1,3,6},{2},{4},{5}}
=> {{1},{2,3,4},{5,6}}
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => {{1,3,5,6},{2},{4}}
=> {{1},{2},{3,4},{5,6}}
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => {{1,6},{2},{3,4},{5}}
=> {{1},{2,3,5,6},{4}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => {{1,6},{2},{3,5},{4}}
=> {{1},{2,5,6},{3,4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => {{1,5,6},{2},{3,4}}
=> {{1},{2},{3,5,6},{4}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => {{1,3,4,6},{2},{5}}
=> {{1},{2,3},{4},{5,6}}
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => {{1,3,6},{2},{4,5}}
=> {{1},{2,4},{3},{5,6}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => {{1,6},{2},{3,4,5}}
=> {{1},{2,5,6},{3},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => {{1,3,4,5,6},{2}}
=> {{1},{2},{3},{4},{5,6}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => {{1,2,6},{3},{4},{5}}
=> {{1},{2,3,4,5},{6}}
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => {{1,2,5,6},{3},{4}}
=> {{1},{2},{3,4,5},{6}}
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => {{1,2,4,6},{3},{5}}
=> {{1},{2,3},{4,5},{6}}
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => {{1,2,6},{3},{4,5}}
=> {{1},{2,4,5},{3},{6}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => {{1,2,4,5,6},{3}}
=> {{1},{2},{3},{4,5},{6}}
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => {{1,6},{2,3},{4},{5}}
=> {{1},{2,3,4,6},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => {{1,5,6},{2,3},{4}}
=> {{1},{2},{3,4,6},{5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => {{1,6},{2,4},{3},{5}}
=> {{1},{2,3,6},{4,5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => {{1,5},{2,6},{3},{4}}
=> {{1,3,4,5},{2,6}}
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => {{1,5,6},{2,4},{3}}
=> {{1},{2},{3,6},{4,5}}
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => {{1,4,6},{2,3},{5}}
=> {{1},{2,3},{4,6},{5}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => {{1,6},{2,3},{4,5}}
=> {{1},{2,4,6},{3},{5}}
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => {{1,6},{2,4,5},{3}}
=> {{1},{2,6},{3},{4,5}}
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => {{1,4,5,6},{2,3}}
=> {{1},{2},{3},{4,6},{5}}
=> 1
[]
=> [1] => {{1}}
=> {{1}}
=> ? = 0
Description
The nesting number of a set partition.
This is the maximal number of chords in the standard representation of a set partition that mutually nest.
Matching statistic: St001031
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001031: Dyck paths ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001031: Dyck paths ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
[]
=> [1,0]
=> [1,0]
=> [1,0]
=> ? = 0
Description
The height of the bicoloured Motzkin path associated with the Dyck path.
Matching statistic: St001280
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
St001280: Integer partitions ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
St001280: Integer partitions ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [2]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [1,1]
=> 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [3]
=> 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [2,1]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [1,1,1]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [3,1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,1]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [3,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,1,1]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,1]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,1,1]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,1,1]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,1,1,1]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,4,3,2,1] => [5]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [4,1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,1]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => [4,1]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [3,1,1]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5,2,4,3,1] => [4,1]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,1,1]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => [4,1]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [3,2]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [3,1,1]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [3,1,1]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,1,1]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [3,1,1]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,1,1,1]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => [4,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [3,1,1]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,1,1]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => [3,1,1]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [2,1,1,1]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => [4,1]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [3,1,1]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => [3,2]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [3,2]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,1,1]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => [3,1,1]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,2,1]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,1,1,1]
=> 1
[]
=> []
=> [] => []
=> ? = 0
Description
The number of parts of an integer partition that are at least two.
Matching statistic: St001393
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001393: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001393: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => ([],2)
=> 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,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,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,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,1,1,0,1,1,0,0,0,0]
=> [5,2,4,3,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 1
[]
=> []
=> [] => ([],0)
=> ? = 0
Description
The induced matching number of a graph.
An induced matching of a graph is a set of independent edges which is an induced subgraph. This statistic records the maximal number of edges in an induced matching.
Matching statistic: St001261
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001261: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001261: Graphs ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => ([],1)
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => ([],2)
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,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,0,1,1,1,0,0,0,0]
=> [2,5,4,3,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,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5,2,4,3,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,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,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]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 2 = 1 + 1
[]
=> []
=> [] => ([],0)
=> ? = 0 + 1
Description
The Castelnuovo-Mumford regularity of a graph.
The following 103 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000253The crossing number of a set partition. 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$. St000884The number of isolated descents of a permutation. St001330The hat guessing number of a graph. St001729The number of visible descents of a permutation. St001928The number of non-overlapping descents in a permutation. St000470The number of runs in a permutation. St000619The number of cyclic descents of a permutation. St001737The number of descents of type 2 in a permutation. St000035The number of left outer peaks of a permutation. St000455The second largest eigenvalue of a graph if it is integral. St000527The width of the poset. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000099The number of valleys of a permutation, including the boundary. St000325The width of the tree associated to a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000284The Plancherel distribution on integer partitions. St000618The number of self-evacuating tableaux of given shape. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. 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. St000781The number of proper colouring schemes of a Ferrers diagram. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000934The 2-degree of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001128The exponens consonantiae of a partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001568The smallest positive integer that does not appear twice in the partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. 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. 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. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. 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. St000567The sum of the products of all pairs of parts. 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. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. 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. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001525The number of symmetric hooks on the diagonal of a partition. St001561The value of the elementary symmetric function evaluated at 1. St001586The number of odd parts smaller than the largest even part in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. 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. St001597The Frobenius rank of a skew partition. St000486The number of cycles of length at least 3 of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000243The number of cyclic valleys and cyclic peaks of a permutation. St001624The breadth of a lattice. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001960The number of descents of a permutation minus one if its first entry is not one. St001487The number of inner corners of a skew partition. St000028The number of stack-sorts needed to sort a permutation. St000862The number of parts of the shifted shape 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!