searching the database
Your data matches 213 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: St001198
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
St001198: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,1,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,1,0,0]
=> 3
Description
The 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$.
Matching statistic: St001206
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
St001206: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,1,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,1,0,0]
=> 3
Description
The 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$.
Matching statistic: St001031
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001031: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001031: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
Description
The height of the bicoloured Motzkin path associated with the Dyck path.
Matching statistic: St001761
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St001761: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001761: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [2,3,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,3,2] => 1 = 2 - 1
[1,1,0,1,0,0]
=> [3,1,2] => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1 = 2 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => 2 = 3 - 1
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: St000253
(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
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000253: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000253: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => {{1,2}}
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [2,3,1] => {{1,2,3}}
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => {{1,2},{3}}
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,3,2] => {{1},{2,3}}
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [3,1,2] => {{1,3},{2}}
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => {{1,2,3,4}}
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => {{1,2,3},{4}}
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => {{1,2,4},{3}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => {{1,2},{3},{4}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => {{1},{2,3,4}}
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => {{1,3,4},{2}}
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => {{1,3},{2,4}}
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => {{1,3},{2},{4}}
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => {{1,4},{2},{3}}
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => {{1,2,3,4,5}}
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => {{1,2,3,4},{5}}
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => {{1,2,3},{4,5}}
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => {{1,2,3,5},{4}}
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => {{1,2,3},{4},{5}}
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => {{1,2},{3,4,5}}
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => {{1,2,4,5},{3}}
=> 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => {{1,2,4},{3,5}}
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => {{1,2,4},{3},{5}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => {{1,2},{3,5},{4}}
=> 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => {{1,2,5},{3},{4}}
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => {{1},{2,3,4,5}}
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => {{1},{2,3,4},{5}}
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => {{1},{2,3,5},{4}}
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => {{1,3,4,5},{2}}
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => {{1,3,4},{2},{5}}
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => {{1,3},{2,4,5}}
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => {{1,3,5},{2,4}}
=> 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => {{1,3},{2,4},{5}}
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => {{1,3},{2},{4,5}}
=> 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => {{1,3,5},{2},{4}}
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => {{1,3},{2,5},{4}}
=> 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => {{1,3},{2},{4},{5}}
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => {{1},{2},{3,4,5}}
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => {{1},{2,4,5},{3}}
=> 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => {{1},{2,4},{3,5}}
=> 2 = 3 - 1
Description
The crossing number of a set partition.
This is the maximal number of chords in the standard representation of a set partition, that mutually cross.
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,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 3 - 1
[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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 1
[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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 3 - 1
[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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 2 - 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 = 3 - 1
[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 = 3 - 1
[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 = 3 - 1
[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 = 2 - 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 = 2 - 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 = 3 - 1
[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 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 2 = 3 - 1
Description
Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001277
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001277: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St001277: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,3,2] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[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 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 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 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 1 = 2 - 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 = 2 - 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 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 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 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 1 = 2 - 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 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 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 = 3 - 1
[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 = 3 - 1
[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 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 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 = 2 - 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 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
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: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St001358: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,3,2] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[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 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 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 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 1 = 2 - 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 = 2 - 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 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 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 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 1 = 2 - 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 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 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 = 3 - 1
[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 = 3 - 1
[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 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 1 = 2 - 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 = 2 - 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 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => ([(1,4),(2,3),(3,4)],5)
=> 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
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: 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,0]
=> [2,1] => [2,1] => [2,1] => 2
[1,0,1,0,1,0]
=> [2,3,1] => [3,1,2] => [2,3,1] => 2
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [1,3,2] => 2
[1,1,0,1,0,0]
=> [3,1,2] => [3,2,1] => [3,2,1] => 2
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,1,2,3] => [2,3,4,1] => 2
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,1,2,4] => [2,3,1,4] => 2
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,3,1,2] => [3,4,2,1] => 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 2
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,2,3] => [1,3,4,2] => 2
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 2
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,2,1,3] => [3,2,4,1] => 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [3,1,4,2] => [2,4,1,3] => 3
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,2,1,4] => [3,2,1,4] => 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 2
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,3,2] => [1,4,3,2] => 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,3,2,1] => [4,3,2,1] => 2
[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,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,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,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,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,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,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,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,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
[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,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,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,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,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,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,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,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,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,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,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,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,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [3,1,5,2,4] => [2,4,1,5,3] => 3
[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
[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
[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,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,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [3,1,5,4,2] => [2,5,1,4,3] => 3
[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,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,2,5,3,4] => [1,2,4,5,3] => 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 2
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => [1,5,3,2,4] => [1,4,3,5,2] => 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => [1,4,2,5,3] => [1,3,5,2,4] => 3
Description
The length of the longest pattern of the form k 1 2...(k-1).
Matching statistic: St000793
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000793: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00066: Permutations —inverse⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000793: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [1,2] => {{1},{2}}
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => {{1},{2},{3}}
=> 2
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => {{1},{2,3}}
=> 2
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => {{1,2},{3}}
=> 2
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => {{1,3},{2}}
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => {{1},{2},{3},{4}}
=> 2
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => {{1},{2},{3,4}}
=> 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => {{1},{2,3},{4}}
=> 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,2,3] => {{1},{2,4},{3}}
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [1,3,4,2] => {{1},{2,3,4}}
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => {{1,2},{3},{4}}
=> 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => {{1,2},{3,4}}
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1,2,4] => {{1,3},{2},{4}}
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,1,2,3] => {{1,4},{2},{3}}
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,1,4,2] => {{1,3,4},{2}}
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [2,3,1,4] => {{1,2,3},{4}}
=> 2
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => {{1,2,4},{3}}
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [3,4,1,2] => {{1,3},{2,4}}
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [1,2,4,5,3] => {{1},{2},{3,4,5}}
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => {{1},{2,5},{3},{4}}
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [1,4,2,5,3] => {{1},{2,4,5},{3}}
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [1,3,4,2,5] => {{1},{2,3,4},{5}}
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [1,3,5,2,4] => {{1},{2,3,5},{4}}
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [1,4,5,2,3] => {{1},{2,4},{3,5}}
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [1,3,4,5,2] => {{1},{2,3,4,5}}
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,3,4] => {{1,2},{3,5},{4}}
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [2,1,4,5,3] => {{1,2},{3,4,5}}
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => {{1,3},{2},{4},{5}}
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => {{1,3},{2},{4,5}}
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => {{1,4},{2},{3},{5}}
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,1,2,5,3] => {{1,4,5},{2},{3}}
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [3,1,4,2,5] => {{1,3,4},{2},{5}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [3,1,5,2,4] => {{1,3,5},{2},{4}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [4,1,5,2,3] => {{1,4},{2},{3,5}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [3,1,4,5,2] => {{1,3,4,5},{2}}
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => [2,3,1,4,5] => {{1,2,3},{4},{5}}
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => [2,3,1,5,4] => {{1,2,3},{4,5}}
=> 2
[1,1,1,0,0,1,0,0,1,0]
=> [3,1,4,2,5] => [2,4,1,3,5] => {{1,2,4},{3},{5}}
=> 2
[1,1,1,0,0,1,0,1,0,0]
=> [3,1,4,5,2] => [2,5,1,3,4] => {{1,2,5},{3},{4}}
=> 3
Description
The length of the longest partition in the vacillating tableau corresponding to a set partition.
To a set partition $\pi$ of $\{1,\dots,r\}$ with at most $n$ blocks we associate a vacillating tableau, following [1], as follows: create a triangular growth diagram by labelling the columns of a triangular grid with row lengths $r-1, \dots, 0$ from left to right $1$ to $r$, and the rows from the shortest to the longest $1$ to $r$. For each arc $(i,j)$ in the standard representation of $\pi$, place a cross into the cell in column $i$ and row $j$.
Next we label the corners of the first column beginning with the corners of the shortest row. The first corner is labelled with the partition $(n)$. If there is a cross in the row separating this corner from the next, label the next corner with the same partition, otherwise with the partition smaller by one. Do the same with the corners of the first row.
Finally, apply Fomin's local rules, to obtain the partitions along the diagonal. These will alternate in size between $n$ and $n-1$.
This statistic is the length of the longest partition on the diagonal of the diagram.
The following 203 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001261The Castelnuovo-Mumford regularity of a graph. St000254The nesting number of a set partition. St001280The number of parts of an integer partition that are at least two. St001393The induced matching number of a graph. St001624The breadth of a lattice. St000884The number of isolated descents of a permutation. St000035The number of left outer peaks of a permutation. St000647The number of big descents of a permutation. St000662The staircase size of the code of a permutation. St000834The number of right outer peaks of a permutation. St000534The number of 2-rises 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. St001330The hat guessing number of a graph. St000470The number of runs in a permutation. St000619The number of cyclic descents of a permutation. St001729The number of visible descents of a permutation. St001928The number of non-overlapping descents in a permutation. St001737The number of descents of type 2 in a permutation. St000007The number of saliances of the permutation. St000455The second largest eigenvalue of a graph if it is integral. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001613The binary logarithm of the size of the center of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001845The number of join irreducibles minus the rank of a lattice. St001095The number of non-isomorphic posets with precisely one further covering relation. St000996The number of exclusive left-to-right maxima of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000331The number of upper interactions of a Dyck path. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St000527The width of the poset. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001621The number of atoms of a lattice. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001625The Möbius invariant of a lattice. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St000314The number of left-to-right-maxima of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000325The width of the tree associated to a permutation. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000015The number of peaks of a Dyck path. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000353The number of inner valleys of a permutation. St000354The number of recoils of a permutation. St000702The number of weak deficiencies of a permutation. St000710The number of big deficiencies of a permutation. St000822The Hadwiger number of the graph. St000836The number of descents of distance 2 of a permutation. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000991The number of right-to-left minima of a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001469The holeyness of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001530The depth of a 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. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two 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. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001549The number of restricted non-inversions between exceedances. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001811The Castelnuovo-Mumford regularity of a permutation. St001871The number of triconnected components of a graph. St001960The number of descents of a permutation minus one if its first entry is not one. St000842The breadth of a permutation. St000669The number of permutations obtained by switching ascents or descents of size 2. St000022The number of fixed points of a permutation. St000359The number of occurrences of the pattern 23-1. St000441The number of successions of a permutation. St000546The number of global descents of a permutation. St000648The number of 2-excedences of a permutation. St000665The number of rafts of a permutation. St000731The number of double exceedences of a permutation. St001394The genus of a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001720The minimal length of a chain of small intervals in a lattice. St001644The dimension of a graph. 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. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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. 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. St001498The normalised height of a Nakayama algebra with magnitude 1. 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. 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. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001616The number of neutral elements in a lattice. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001846The number of elements which do not have a complement in the lattice. St000741The Colin de Verdière graph invariant. St000068The number of minimal elements in a poset. St000058The order of a permutation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000181The number of connected components of the Hasse diagram for the poset. St001890The maximum magnitude of the Möbius function of a poset. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. 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. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000454The largest eigenvalue of a graph if it is integral. St001851The number of Hecke atoms of a signed permutation. St000629The defect of a binary word. St001964The interval resolution global dimension of a poset. St001867The number of alignments of type EN of a signed 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!