searching the database
Your data matches 280 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: St001137
(load all 50 compositions to match this statistic)
(load all 50 compositions to match this statistic)
St001137: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> 0 = 1 - 1
Description
Number of simple modules that are 3-regular in the corresponding Nakayama algebra.
Matching statistic: St000366
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00235: Permutations —descent views to invisible inversion bottoms⟶ Permutations
St000366: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00235: Permutations —descent views to invisible inversion bottoms⟶ Permutations
St000366: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0 = 1 - 1
[1,0,1,0]
=> [2,1] => [2,1] => 0 = 1 - 1
[1,1,0,0]
=> [1,2] => [1,2] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,2,3,1] => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [2,1,4,3,5,6] => [2,1,4,3,5,6] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,1,3,5,4,6] => [2,1,3,5,4,6] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [2,1,3,4,6,5] => [2,1,3,4,6,5] => 0 = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,1,3,4,5,6] => [2,1,3,4,5,6] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,3,4,2,5,6] => [1,4,3,2,5,6] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4,6] => [1,3,2,5,4,6] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,3,2,4,6,5] => [1,3,2,4,6,5] => 0 = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,3,2,4,5,6] => [1,3,2,4,5,6] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,2,4,5,3,6] => [1,2,5,4,3,6] => 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,2,4,3,6,5] => [1,2,4,3,6,5] => 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,2,4,3,5,6] => [1,2,4,3,5,6] => 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,2,3,5,6,4] => [1,2,3,6,5,4] => 1 = 2 - 1
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,2,3,5,4,6] => [1,2,3,5,4,6] => 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,2,3,4,6,5] => [1,2,3,4,6,5] => 0 = 1 - 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,2,4,3,5,6,7] => [1,2,4,3,5,6,7] => 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,2,3,4,6,5,7] => [1,2,3,4,6,5,7] => 0 = 1 - 1
Description
The number of double descents of a permutation.
A double descent of a permutation $\pi$ is a position $i$ such that $\pi(i) > \pi(i+1) > \pi(i+2)$.
Matching statistic: St000648
(load all 25 compositions to match this statistic)
(load all 25 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000648: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000648: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 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,4,3,5] => 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => 0 = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,4,3,2,5,6] => 1 = 2 - 1
[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,3,2,5,4,6] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => 0 = 1 - 1
[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,3,2,4,5,6] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,2,5,4,3,6] => 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,2,3,6,5,4] => 1 = 2 - 1
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 0 = 1 - 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,2,4,3,5,6,7] => 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,4,6,5,7] => 0 = 1 - 1
Description
The number of 2-excedences of a permutation.
This is the number of positions $1\leq i\leq n$ such that $\sigma(i)=i+2$.
Matching statistic: St000661
(load all 87 compositions to match this statistic)
(load all 87 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000661: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000661: 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 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,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 - 1
[1,0,1,0,1,0,1,1,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]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,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,1,1,0,1,0,0,0,1,0,1,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,1,0,1,1,1,0,0,1,0,0,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,1,0,1,1,0,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,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,0,1,1,0,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,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,0,1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
Description
The number of rises of length 3 of a Dyck path.
Matching statistic: St000183
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St000183: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St000183: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => [1,2] => [1,1]
=> 1
[1,0,1,0]
=> [3,1,2] => [3,1,2] => [3]
=> 1
[1,1,0,0]
=> [2,3,1] => [1,2,3] => [1,1,1]
=> 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [3,4,1,2] => [2,2]
=> 2
[1,0,1,1,0,0]
=> [3,1,4,2] => [3,1,2,4] => [3,1]
=> 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [4,2,1,3] => [3,1]
=> 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,1,3,2] => [3,1]
=> 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [3,4,5,1,2] => [5]
=> 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [3,4,1,2,5] => [2,2,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,5,2,1,4] => [5]
=> 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,1,2,4,5] => [3,1,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [4,2,5,1,3] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [4,2,1,3,5] => [3,1,1]
=> 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [4,1,3,2,5] => [3,1,1]
=> 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => [3,1,1]
=> 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [5,2,1,4,3] => [3,1,1]
=> 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [3,4,5,1,2,6] => [5,1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [3,4,6,2,1,5] => [4,2]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [3,4,1,2,5,6] => [2,2,1,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,5,2,6,1,4] => [4,2]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,5,2,1,4,6] => [5,1]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,6,2,4,1,5] => [5,1]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [3,1,2,4,5,6] => [3,1,1,1]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [4,2,5,6,1,3] => [5,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [4,2,5,1,3,6] => [2,2,1,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,2,6,3,1,5] => [5,1]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [4,2,1,3,5,6] => [3,1,1,1]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [5,2,3,6,1,4] => [2,2,1,1]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [5,2,3,1,4,6] => [3,1,1,1]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [6,2,3,4,1,5] => [3,1,1,1]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,1,5,2,6,7,4] => [3,5,2,1,4,6,7] => [5,1,1]
=> 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [3,1,4,6,2,7,5] => [3,6,2,4,1,5,7] => [5,1,1]
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [3,1,4,5,7,2,6] => [3,7,2,4,5,1,6] => [5,1,1]
=> 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [3,1,4,5,6,7,2] => [3,1,2,4,5,6,7] => [3,1,1,1,1]
=> 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [2,5,1,3,6,7,4] => [4,2,5,1,3,6,7] => [2,2,1,1,1]
=> 2
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [2,4,1,6,3,7,5] => [4,2,6,3,1,5,7] => [5,1,1]
=> 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,4,1,5,7,3,6] => [4,2,7,3,5,1,6] => [5,1,1]
=> 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,4,1,5,6,7,3] => [4,2,1,3,5,6,7] => [3,1,1,1,1]
=> 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [2,3,6,1,4,7,5] => [5,2,3,6,1,4,7] => [2,2,1,1,1]
=> 2
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [2,3,5,1,7,4,6] => [5,2,3,7,4,1,6] => [5,1,1]
=> 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,1,4,6,7] => [3,1,1,1,1]
=> 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [2,3,4,7,1,5,6] => [6,2,3,4,7,1,5] => [2,2,1,1,1]
=> 2
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [2,3,4,6,1,7,5] => [6,2,3,4,1,5,7] => [3,1,1,1,1]
=> 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [2,3,4,5,7,1,6] => [7,2,3,4,5,1,6] => [3,1,1,1,1]
=> 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [2,3,4,5,6,7,1] => [1,2,3,4,5,6,7] => [1,1,1,1,1,1,1]
=> 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [2,3,5,1,6,7,8,4] => [5,2,3,1,4,6,7,8] => [3,1,1,1,1,1]
=> 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [2,3,4,5,7,1,8,6] => [7,2,3,4,5,1,6,8] => [3,1,1,1,1,1]
=> 1
Description
The side length of the Durfee square of an integer partition.
Given a partition $\lambda = (\lambda_1,\ldots,\lambda_n)$, the Durfee square is the largest partition $(s^s)$ whose diagram fits inside the diagram of $\lambda$. In symbols, $s = \max\{ i \mid \lambda_i \geq i \}$.
This is also known as the Frobenius rank.
Matching statistic: St000755
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St000755: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St000755: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => [1,2] => [1,1]
=> 1
[1,0,1,0]
=> [3,1,2] => [3,1,2] => [3]
=> 1
[1,1,0,0]
=> [2,3,1] => [1,2,3] => [1,1,1]
=> 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [3,4,1,2] => [2,2]
=> 2
[1,0,1,1,0,0]
=> [3,1,4,2] => [3,1,2,4] => [3,1]
=> 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [4,2,1,3] => [3,1]
=> 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,1,3,2] => [3,1]
=> 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [3,4,5,1,2] => [5]
=> 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [3,4,1,2,5] => [2,2,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,5,2,1,4] => [5]
=> 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,1,2,4,5] => [3,1,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [4,2,5,1,3] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [4,2,1,3,5] => [3,1,1]
=> 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [4,1,3,2,5] => [3,1,1]
=> 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => [3,1,1]
=> 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [5,2,1,4,3] => [3,1,1]
=> 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [3,4,5,1,2,6] => [5,1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [3,4,6,2,1,5] => [4,2]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [3,4,1,2,5,6] => [2,2,1,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,5,2,6,1,4] => [4,2]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,5,2,1,4,6] => [5,1]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,6,2,4,1,5] => [5,1]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [3,1,2,4,5,6] => [3,1,1,1]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [4,2,5,6,1,3] => [5,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [4,2,5,1,3,6] => [2,2,1,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,2,6,3,1,5] => [5,1]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [4,2,1,3,5,6] => [3,1,1,1]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [5,2,3,6,1,4] => [2,2,1,1]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [5,2,3,1,4,6] => [3,1,1,1]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [6,2,3,4,1,5] => [3,1,1,1]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,1,5,2,6,7,4] => [3,5,2,1,4,6,7] => [5,1,1]
=> 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [3,1,4,6,2,7,5] => [3,6,2,4,1,5,7] => [5,1,1]
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [3,1,4,5,7,2,6] => [3,7,2,4,5,1,6] => [5,1,1]
=> 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [3,1,4,5,6,7,2] => [3,1,2,4,5,6,7] => [3,1,1,1,1]
=> 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [2,5,1,3,6,7,4] => [4,2,5,1,3,6,7] => [2,2,1,1,1]
=> 2
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [2,4,1,6,3,7,5] => [4,2,6,3,1,5,7] => [5,1,1]
=> 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,4,1,5,7,3,6] => [4,2,7,3,5,1,6] => [5,1,1]
=> 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,4,1,5,6,7,3] => [4,2,1,3,5,6,7] => [3,1,1,1,1]
=> 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [2,3,6,1,4,7,5] => [5,2,3,6,1,4,7] => [2,2,1,1,1]
=> 2
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [2,3,5,1,7,4,6] => [5,2,3,7,4,1,6] => [5,1,1]
=> 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,1,4,6,7] => [3,1,1,1,1]
=> 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [2,3,4,7,1,5,6] => [6,2,3,4,7,1,5] => [2,2,1,1,1]
=> 2
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [2,3,4,6,1,7,5] => [6,2,3,4,1,5,7] => [3,1,1,1,1]
=> 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [2,3,4,5,7,1,6] => [7,2,3,4,5,1,6] => [3,1,1,1,1]
=> 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [2,3,4,5,6,7,1] => [1,2,3,4,5,6,7] => [1,1,1,1,1,1,1]
=> 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [2,3,5,1,6,7,8,4] => [5,2,3,1,4,6,7,8] => [3,1,1,1,1,1]
=> 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [2,3,4,5,7,1,8,6] => [7,2,3,4,5,1,6,8] => [3,1,1,1,1,1]
=> 1
Description
The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition.
Consider the recurrence $$f(n)=\sum_{p\in\lambda} f(n-p).$$ This statistic returns the number of distinct real roots of the associated characteristic polynomial.
For example, the partition $(2,1)$ corresponds to the recurrence $f(n)=f(n-1)+f(n-2)$ with associated characteristic polynomial $x^2-x-1$, which has two real roots.
Matching statistic: St000883
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000883: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000883: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [1,2] => 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [1,2] => 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => [1,4,2,3,5] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [1,3,2,4,5] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,3,2,4,5] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => [1,2,3,4,5,6] => 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [1,2,3,4,5,6] => 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [1,2,3,4,5,6] => 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,4,3,2,5,6] => [1,2,4,3,5,6] => 2
[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,3,2,5,4,6] => [1,2,3,4,5,6] => 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,2,3,4,5,6] => 1
[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,3,2,4,5,6] => [1,2,3,4,5,6] => 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,2,5,4,3,6] => [1,2,3,5,4,6] => 2
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => [1,2,3,4,5,6] => 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [1,2,3,4,5,6] => 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,2,3,6,5,4] => [1,2,3,4,6,5] => 2
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [1,2,3,4,5,6] => 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [1,2,3,4,5,6] => 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,2,4,3,5,6,7] => [1,2,3,4,5,6,7] => 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,4,6,5,7] => [1,2,3,4,5,6,7] => 1
Description
The number of longest increasing subsequences of a permutation.
Matching statistic: St001359
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00239: Permutations —Corteel⟶ Permutations
St001359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00239: Permutations —Corteel⟶ Permutations
St001359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [2,1] => 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [1,2] => 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,4,1,2] => 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => [3,4,1,2,5] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [2,3,1,5,4] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [2,3,1,4,5] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,5,2,3] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => [2,1,4,3,5,6] => 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [2,1,3,5,4,6] => 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [2,1,3,4,6,5] => 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [2,1,3,4,5,6] => 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,4,3,2,5,6] => [1,3,4,2,5,6] => 2
[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,3,2,5,4,6] => [1,3,2,5,4,6] => 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,3,2,4,6,5] => 1
[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,3,2,4,5,6] => [1,3,2,4,5,6] => 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,2,5,4,3,6] => [1,2,4,5,3,6] => 2
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => [1,2,4,3,6,5] => 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [1,2,4,3,5,6] => 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,2,3,6,5,4] => [1,2,3,5,6,4] => 2
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [1,2,3,5,4,6] => 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [1,2,3,4,6,5] => 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,2,4,3,5,6,7] => [1,2,4,3,5,6,7] => 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,4,6,5,7] => [1,2,3,4,6,5,7] => 1
Description
The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles.
In other words, this is $2^k$ where $k$ is the number of cycles of length at least three ([[St000486]]) in its cycle decomposition.
The generating function for the number of equivalence classes, $f(n)$, is
$$\sum_{n\geq 0} f(n)\frac{x^n}{n!} = \frac{e(\frac{x}{2} + \frac{x^2}{4})}{\sqrt{1-x}}.$$
Matching statistic: St001483
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001483: 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
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001483: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,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,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
[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,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 1
[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,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 1
[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,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 2
[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,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,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> 1
[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,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 2
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0,1,0]
=> 1
Description
The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module.
Matching statistic: St001719
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001719: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001719: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> ([(0,1)],2)
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> ([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(1,2)],3)
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([],3)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,6),(2,5),(3,7),(4,2),(4,7),(5,6),(7,1),(7,5)],8)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> ([(0,4),(1,6),(1,7),(2,5),(2,7),(3,5),(3,6),(4,1),(4,2),(4,3),(5,8),(6,8),(7,8)],9)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(2,6),(2,7),(3,5),(3,7),(4,5),(4,6),(5,8),(6,8),(7,8),(8,1)],9)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,3),(0,4),(1,7),(2,6),(3,8),(4,8),(5,1),(5,6),(6,7),(8,2),(8,5)],9)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,4),(0,5),(1,8),(2,6),(3,6),(4,7),(5,1),(5,7),(7,8),(8,2),(8,3)],9)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(0,3),(0,4),(1,6),(2,6),(3,7),(4,7),(5,1),(5,2),(7,5)],8)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,6),(3,7),(4,8),(5,1),(5,8),(6,7),(7,2),(8,3),(8,6)],9)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(0,4),(0,5),(1,6),(2,6),(4,7),(5,7),(6,3),(7,1),(7,2)],8)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> ([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2)],6)
=> ([(0,5),(1,8),(2,8),(3,7),(4,7),(5,6),(6,1),(6,2),(8,3),(8,4)],9)
=> 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> ([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
=> ([(0,6),(1,8),(2,8),(3,7),(4,7),(5,3),(5,4),(6,1),(6,2),(8,5)],9)
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> ([(0,5),(1,5),(4,2),(4,3),(5,4)],6)
=> ([(0,3),(0,4),(1,7),(2,7),(3,8),(4,8),(5,6),(6,1),(6,2),(8,5)],9)
=> 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> ([(0,5),(1,7),(2,7),(3,4),(4,6),(5,3),(6,1),(6,2)],8)
=> 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> ([(0,5),(2,8),(3,7),(4,2),(4,7),(5,6),(6,3),(6,4),(7,8),(8,1)],9)
=> 2
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> ([(0,6),(1,8),(2,8),(3,7),(4,7),(6,1),(6,2),(7,5),(8,3),(8,4)],9)
=> 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,5),(3,5),(4,2),(4,3)],6)
=> ([(0,4),(0,5),(2,8),(3,8),(4,7),(5,7),(6,2),(6,3),(7,6),(8,1)],9)
=> 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(0,5),(1,7),(2,7),(4,6),(5,4),(6,1),(6,2),(7,3)],8)
=> 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
=> ([(0,6),(2,8),(3,7),(4,2),(4,7),(5,1),(6,3),(6,4),(7,8),(8,5)],9)
=> 2
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(3,2),(4,3),(5,3)],6)
=> ([(0,4),(0,5),(2,7),(3,7),(4,8),(5,8),(6,1),(7,6),(8,2),(8,3)],9)
=> 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(0,5),(2,7),(3,7),(4,1),(5,6),(6,2),(6,3),(7,4)],8)
=> 1
[1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> ([(0,5),(1,3),(3,5),(4,2),(5,4)],6)
=> ([(0,3),(0,6),(1,8),(3,7),(4,2),(5,4),(6,1),(6,7),(7,8),(8,5)],9)
=> 2
[1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(0,6),(2,7),(3,7),(4,1),(5,4),(6,2),(6,3),(7,5)],8)
=> 1
[1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,2),(0,3),(2,7),(3,7),(4,5),(5,1),(6,4),(7,6)],8)
=> 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 1
[1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> ([(0,6),(2,8),(3,8),(4,7),(5,1),(6,4),(7,2),(7,3),(8,5)],9)
=> 1
[1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> ([(0,7),(2,8),(3,8),(4,5),(5,1),(6,4),(7,2),(7,3),(8,6)],9)
=> 1
Description
The number of shortest chains of small intervals from the bottom to the top in a lattice.
An interval $[a, b]$ in a lattice is small if $b$ is a join of elements covering $a$.
The following 270 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001732The number of peaks visible from the left. St000214The number of adjacencies of a permutation. St000237The number of small exceedances. St000313The number of degree 2 vertices of a graph. St000360The number of occurrences of the pattern 32-1. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000658The number of rises of length 2 of a Dyck path. St000660The number of rises of length at least 3 of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000731The number of double exceedences of a permutation. St000884The number of isolated descents of a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001071The beta invariant of the graph. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001172The number of 1-rises at odd height of a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001323The independence gap of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001411The number of patterns 321 or 3412 in a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001689The number of celebrities in a graph. St001728The number of invisible descents of a permutation. St001781The interlacing number of a set partition. St001797The number of overfull subgraphs of a graph. St001801Half the number of preimage-image pairs of different parity in a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St000886The number of permutations with the same antidiagonal sums. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St000486The number of cycles of length at least 3 of a permutation. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000732The number of double deficiencies of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001532The leading coefficient of the Poincare polynomial of the poset cone. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000534The number of 2-rises of a permutation. St001525The number of symmetric hooks on the diagonal of a partition. St001657The number of twos in an integer partition. St000002The number of occurrences of the pattern 123 in a permutation. St000454The largest eigenvalue of a graph if it is integral. St000317The cycle descent number of a permutation. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000039The number of crossings of a permutation. St000232The number of crossings of a set partition. St000357The number of occurrences of the pattern 12-3. St000365The number of double ascents of a permutation. St000367The number of simsun double descents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000562The number of internal points of a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000598The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, 3 is maximal, (2,3) are consecutive in a block. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000650The number of 3-rises of a permutation. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001394The genus of a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001841The number of inversions of a set partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001082The number of boxed occurrences of 123 in a permutation. St001130The number of two successive successions in a permutation. St001399The distinguishing number of a poset. St000633The size of the automorphism group of a poset. St000850The number of 1/2-balanced pairs in a poset. St001513The number of nested exceedences of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001330The hat guessing number of a graph. St001877Number of indecomposable injective modules with projective dimension 2. St001624The breadth of a lattice. St000215The number of adjacencies of a permutation, zero appended. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St000649The number of 3-excedences of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000335The difference of lower and upper interactions. 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. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St001095The number of non-isomorphic posets with precisely one further covering relation. St001535The number of cyclic alignments of a permutation. St001846The number of elements which do not have a complement in the lattice. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St001964The interval resolution global dimension of a poset. St000488The number of cycles of a permutation of length at most 2. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000834The number of right outer peaks of a permutation. St001128The exponens consonantiae of a partition. St000220The number of occurrences of the pattern 132 in a permutation. St000356The number of occurrences of the pattern 13-2. St000405The number of occurrences of the pattern 1324 in a permutation. St000433The number of occurrences of the pattern 132 or of the pattern 321 in a permutation. 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. St001083The number of boxed occurrences of 132 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001115The number of even descents of a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000181The number of connected components of the Hasse diagram for the poset. St000635The number of strictly order preserving maps of a poset into itself. St001490The number of connected components of a skew partition. St001890The maximum magnitude of the Möbius function of a poset. St000842The breadth of a permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000153The number of adjacent cycles of a permutation. St000451The length of the longest pattern of the form k 1 2. St000741The Colin de Verdière graph invariant. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000455The second largest eigenvalue of a graph if it is integral. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000456The monochromatic index of a connected graph. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001060The distinguishing index of a graph. St001545The second Elser number of a connected graph. St001616The number of neutral elements in a lattice. St001625The Möbius invariant of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001720The minimal length of a chain of small intervals in a lattice. St001866The nesting alignments of a signed permutation. St000264The girth of a graph, which is not a tree. St001344The neighbouring number of a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001857The number of edges in the reduced word graph of a signed permutation. St000078The number of alternating sign matrices whose left key is the permutation. St000099The number of valleys of a permutation, including the boundary. St000239The number of small weak excedances. St000241The number of cyclical small excedances. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000255The number of reduced Kogan faces with the permutation as type. St000570The Edelman-Greene number of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001162The minimum jump of a permutation. St001220The width of a permutation. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001413Half the length of the longest even length palindromic prefix of a binary word. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001768The number of reduced words of a signed permutation. St000017The number of inversions of a standard tableau. St000023The number of inner peaks of a permutation. St000091The descent variation of a composition. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000217The number of occurrences of the pattern 312 in a permutation. St000236The number of cyclical small weak excedances. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000308The height of the tree associated to a permutation. St000338The number of pixed points of a permutation. St000358The number of occurrences of the pattern 31-2. St000370The genus of a graph. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000489The number of cycles of a permutation of length at most 3. St000504The cardinality of the first block of a set partition. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000624The normalized sum of the minimal distances to a greater element. St000636The hull number of a graph. St000666The number of right tethers of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000779The tier of a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000872The number of very big descents of a permutation. St000873The aix statistic of a permutation. St000881The number of short braid edges in the graph of braid moves of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001062The maximal size of a block of a set partition. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. 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$. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001309The number of four-cliques in a graph. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001470The cyclic holeyness of a permutation. St001537The number of cyclic crossings of a permutation. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001654The monophonic hull number of a graph. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001715The number of non-records in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001856The number of edges in the reduced word graph of a permutation. St001867The number of alignments of type EN of a signed permutation. St001871The number of triconnected components of a graph. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001948The number of augmented double ascents of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000908The length of the shortest maximal antichain in a poset. St000911The number of maximal antichains of maximal size in a poset. St000914The sum of the values of the Möbius function of a poset. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000298The order dimension or Dushnik-Miller dimension of a poset. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000879The number of long braid edges in the graph of braid moves of a permutation. St000907The number of maximal antichains of minimal length in a poset. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001301The first Betti number of the order complex associated with the poset. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001845The number of join irreducibles minus the rank of a lattice. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. 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$. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001651The Frankl number of a lattice. St001875The number of simple modules with projective dimension at most 1.
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!