searching the database
Your data matches 96 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: St001255
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
St001255: 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]
=> 3 = 2 + 1
[1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,1,0,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,1,0,0,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,0,1,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,1,0,0,0,0]
=> 4 = 3 + 1
Description
The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J.
Matching statistic: St000235
(load all 42 compositions to match this statistic)
(load all 42 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000235: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000235: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [2,1] => 0
[1,1,0,0]
=> [1,2] => 2
[1,0,1,0,1,0]
=> [3,2,1] => 2
[1,0,1,1,0,0]
=> [2,3,1] => 0
[1,1,0,0,1,0]
=> [3,1,2] => 3
[1,1,0,1,0,0]
=> [2,1,3] => 2
[1,1,1,0,0,0]
=> [1,2,3] => 3
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 2
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 3
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 2
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 0
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 4
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 4
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 4
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 4
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 4
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => 4
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 5
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => 5
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => 5
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => 5
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => 2
Description
The number of indices that are not cyclical small weak excedances.
A cyclical small weak excedance is an index $i < n$ such that $\pi_i = i+1$, or the index $i = n$ if $\pi_n = 1$.
Matching statistic: St001225
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001225: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001225: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 5
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 5
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 5
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 3
Description
The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra.
Matching statistic: St000019
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000019: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000019: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,2] => 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [3,1,2] => 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [3,4,1,2] => 3
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [3,1,2,4] => 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,1,2,3] => 3
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => 3
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => 3
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => 4
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => 4
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [3,4,5,6,1,2] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [3,4,5,1,2,6] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [3,4,1,6,2,5] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [3,4,6,1,2,5] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [3,4,1,2,5,6] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [3,1,5,6,2,4] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,1,5,2,4,6] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [3,5,1,6,2,4] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [3,5,6,1,2,4] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [3,5,1,2,4,6] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [3,1,2,6,4,5] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [3,1,6,2,4,5] => 5
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [3,6,1,2,4,5] => 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [3,1,2,4,5,6] => 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,4,5,6,2,3] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,4,5,2,3,6] => 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,4,2,6,3,5] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,4,6,2,3,5] => 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,4,2,3,5,6] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [4,1,5,6,2,3] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [4,1,5,2,3,6] => 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [4,5,1,6,2,3] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [4,5,6,1,2,3] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [4,5,1,2,3,6] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [4,1,2,6,3,5] => 5
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [4,1,6,2,3,5] => 5
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [4,6,1,2,3,5] => 5
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [4,1,2,3,5,6] => 3
Description
The cardinality of the support of a permutation.
A permutation $\sigma$ may be written as a product $\sigma = s_{i_1}\dots s_{i_k}$ with $k$ minimal, where $s_i = (i,i+1)$ denotes the simple transposition swapping the entries in positions $i$ and $i+1$.
The set of indices $\{i_1,\dots,i_k\}$ is the '''support''' of $\sigma$ and independent of the chosen way to write $\sigma$ as such a product.
See [2], Definition 1 and Proposition 10.
The '''connectivity set''' of $\sigma$ of length $n$ is the set of indices $1 \leq i < n$ such that $\sigma(k) < i$ for all $k < i$.
Thus, the connectivity set is the complement of the support.
Matching statistic: St000673
(load all 96 compositions to match this statistic)
(load all 96 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000673: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000673: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,2] => 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => 4
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => 4
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,4,1,2,5] => 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => 3
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,2,1,4,5] => 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [2,3,1,4,5] => 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,3,5] => 4
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [3,1,2,4,5] => 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [2,1,3,4,5] => 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,1,6] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [4,5,3,2,1,6] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [5,3,4,2,1,6] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [4,3,5,2,1,6] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [3,4,5,2,1,6] => 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [5,4,2,3,1,6] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [4,5,2,3,1,6] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [5,3,2,4,1,6] => 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [4,3,2,5,1,6] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [3,4,2,5,1,6] => 5
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [5,2,3,4,1,6] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [4,2,3,5,1,6] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [3,2,4,5,1,6] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,1,6] => 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [5,4,3,1,2,6] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [4,5,3,1,2,6] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [5,3,4,1,2,6] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [4,3,5,1,2,6] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,4,5,1,2,6] => 5
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [5,4,2,1,3,6] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [4,5,2,1,3,6] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [5,3,2,1,4,6] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [4,3,2,1,5,6] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [3,4,2,1,5,6] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [5,2,3,1,4,6] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [4,2,3,1,5,6] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [3,2,4,1,5,6] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [2,3,4,1,5,6] => 4
Description
The number of non-fixed points of a permutation.
In other words, this statistic is $n$ minus the number of fixed points ([[St000022]]) of $\pi$.
Matching statistic: St001005
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001005: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001005: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,2] => 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,3,2] => 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,3,4,2] => 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,2,4,3] => 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => 4
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,4,2,5,3] => 4
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,4,5,2,3] => 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,4,2,3,5] => 3
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,2,4,3,5] => 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,2,4,5,3] => 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,5,2,3,4] => 4
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,2,5,3,4] => 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,2,3,5,4] => 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4,6] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4,6] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,3,2,5,6,4] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,3,5,2,6,4] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,3,5,6,2,4] => 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,3,2,6,4,5] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,3,6,2,4,5] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,3,2,4,6,5] => 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,3,4,2,6,5] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,3,4,6,2,5] => 5
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,3,2,4,5,6] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,3,4,2,5,6] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,3,4,5,2,6] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,3,4,5,6,2] => 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,4,2,5,3,6] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,4,5,2,3,6] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,4,2,5,6,3] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,4,5,2,6,3] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,4,5,6,2,3] => 5
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,4,2,6,3,5] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,4,6,2,3,5] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,4,2,3,6,5] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,2,4,3,6,5] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,2,4,6,3,5] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,4,2,3,5,6] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,2,4,3,5,6] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,2,4,5,3,6] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,2,4,5,6,3] => 4
Description
The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both.
Matching statistic: St001279
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St001279: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00108: Permutations —cycle type⟶ Integer partitions
St001279: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1]
=> 0
[1,0,1,0]
=> [2,1] => [2]
=> 2
[1,1,0,0]
=> [1,2] => [1,1]
=> 0
[1,0,1,0,1,0]
=> [2,1,3] => [2,1]
=> 2
[1,0,1,1,0,0]
=> [2,3,1] => [3]
=> 3
[1,1,0,0,1,0]
=> [3,1,2] => [3]
=> 3
[1,1,0,1,0,0]
=> [1,3,2] => [2,1]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,1,1]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => [2,2]
=> 4
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [4]
=> 4
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => [3,1]
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [4]
=> 4
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => [4]
=> 4
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [2,2]
=> 4
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => [3,1]
=> 3
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => [2,1,1]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => [3,1]
=> 3
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [4]
=> 4
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [3,1]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => [2,1,1]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,1,1,1]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => [2,2,1]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => [4,1]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => [3,2]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [5]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [3,2]
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => [3,2]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => [5]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => [2,2,1]
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => [3,2]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [5]
=> 5
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => [2,1,1,1]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => [3,1,1]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => [4,1]
=> 4
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5]
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => [4,1]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => [2,2,1]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => [5]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => [3,2]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [5]
=> 5
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => [5]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => [3,2]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => [3,2]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,1]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => [3,1,1]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => [2,1,1,1]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => [3,1,1]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => [4,1]
=> 4
Description
The sum of the parts of an integer partition that are at least two.
Matching statistic: St001480
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001480: 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
St001480: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[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]
=> 3
[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]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4
[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]
=> 2
[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]
=> 3
[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]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 4
[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]
=> 3
[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]
=> 2
[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]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4
[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,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5
[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]
=> 4
[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]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 5
[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]
=> 3
[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]
=> 5
[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]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 4
[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]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 5
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 5
[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]
=> 2
[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]
=> 4
[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]
=> 3
[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]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 4
[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]
=> 2
[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,1,1,0,1,0,0,0,0]
=> 5
[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,1,0,1,0,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 4
[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,0,1,1,0,0,1,0,0]
=> 5
[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]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 5
[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,0,1,0,0,1,0,1,0]
=> 3
Description
The number of simple summands of the module J^2/J^3. Here J is the Jacobson radical of the Nakayama algebra algebra corresponding to the Dyck path.
Matching statistic: St000238
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000238: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000238: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [2,1] => 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 1 = 0 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,1,3] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,4,2] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,4,1,2] => 4 = 3 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 4 = 3 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,1,4,5,2] => 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,1,5,2,4] => 5 = 4 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,4,1,5,2] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,4,5,1,2] => 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,5,1,2,4] => 5 = 4 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,5,3] => 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1,5,2,3] => 5 = 4 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,5,1,2,3] => 5 = 4 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,3,4,6,1,5] => 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [2,3,5,1,6,4] => 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [2,3,5,6,1,4] => 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [2,3,6,1,4,5] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,4,1,5,6,3] => 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,4,1,6,3,5] => 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [2,4,5,1,6,3] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [2,4,5,6,1,3] => 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,4,6,1,3,5] => 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,5,1,3,6,4] => 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [2,5,1,6,3,4] => 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,5,6,1,3,4] => 5 = 4 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,6,1,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,4,5,6,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,1,4,6,2,5] => 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [3,1,5,2,6,4] => 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,1,5,6,2,4] => 6 = 5 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,1,6,2,4,5] => 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [3,4,1,5,6,2] => 4 = 3 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,4,1,6,2,5] => 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [3,4,5,1,6,2] => 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [3,4,5,6,1,2] => 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [3,4,6,1,2,5] => 6 = 5 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [3,5,1,2,6,4] => 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [3,5,1,6,2,4] => 6 = 5 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [3,5,6,1,2,4] => 6 = 5 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,6,1,2,4,5] => 6 = 5 + 1
Description
The number of indices that are not small weak excedances.
A small weak excedance is an index $i$ such that $\pi_i \in \{i,i+1\}$.
Matching statistic: St000240
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000240: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000240: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [2,1] => 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 1 = 0 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,1,3] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,4,2] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,4,1,2] => 4 = 3 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 4 = 3 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,1,4,5,2] => 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,1,5,2,4] => 5 = 4 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,4,1,5,2] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,4,5,1,2] => 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,5,1,2,4] => 5 = 4 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,5,3] => 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1,5,2,3] => 5 = 4 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,5,1,2,3] => 5 = 4 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,3,4,6,1,5] => 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [2,3,5,1,6,4] => 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [2,3,5,6,1,4] => 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [2,3,6,1,4,5] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,4,1,5,6,3] => 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,4,1,6,3,5] => 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [2,4,5,1,6,3] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [2,4,5,6,1,3] => 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,4,6,1,3,5] => 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,5,1,3,6,4] => 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [2,5,1,6,3,4] => 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,5,6,1,3,4] => 5 = 4 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,6,1,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,4,5,6,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,1,4,6,2,5] => 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [3,1,5,2,6,4] => 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,1,5,6,2,4] => 6 = 5 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,1,6,2,4,5] => 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [3,4,1,5,6,2] => 4 = 3 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,4,1,6,2,5] => 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [3,4,5,1,6,2] => 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [3,4,5,6,1,2] => 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [3,4,6,1,2,5] => 6 = 5 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [3,5,1,2,6,4] => 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [3,5,1,6,2,4] => 6 = 5 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [3,5,6,1,2,4] => 6 = 5 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,6,1,2,4,5] => 6 = 5 + 1
Description
The number of indices that are not small excedances.
A small excedance is an index $i$ for which $\pi_i = i+1$.
The following 86 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000067The inversion number of the alternating sign matrix. St000141The maximum drop size of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000896The number of zeros on the main diagonal of an alternating sign matrix. St000957The number of Bruhat lower covers of a permutation. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. 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. St001458The rank of the adjacency matrix of a graph. St000054The first entry of the permutation. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000356The number of occurrences of the pattern 13-2. St001090The number of pop-stack-sorts needed to sort a permutation. St000680The Grundy value for Hackendot on posets. St000906The length of the shortest maximal chain in a poset. St000422The energy of a graph, if it is integral. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St000653The last descent of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000264The girth of a graph, which is not a tree. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000454The largest eigenvalue of a graph if it is integral. St000742The number of big ascents of a permutation after prepending zero. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St001645The pebbling number of a connected graph. St001902The number of potential covers of a poset. St000075The orbit size of a standard tableau under promotion. St000647The number of big descents of a permutation. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St001060The distinguishing index of a graph. St001875The number of simple modules with projective dimension at most 1. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000670The reversal length of a permutation. 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$. St001498The normalised height of a Nakayama algebra with magnitude 1. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000474Dyson's crank of a partition. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001176The size of a partition minus its first part. 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$. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001280The number of parts of an integer partition that are at least two. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000711The number of big exceedences of a permutation. 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)$. St000089The absolute variation of a composition. St000091The descent variation of a composition. St000154The sum of the descent bottoms of a permutation. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St000710The number of big deficiencies of a permutation. St000831The number of indices that are either descents or recoils. St000961The shifted major index of a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001388The number of non-attacking neighbors of a permutation. St001402The number of separators in a permutation. St001513The number of nested exceedences of a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St000388The number of orbits of vertices of a graph under automorphisms. St000619The number of cyclic descents of a permutation. St000638The number of up-down runs of a permutation. St000652The maximal difference between successive positions of a permutation. St000767The number of runs in an integer composition. St001352The number of internal nodes in the modular decomposition of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001439The number of even weak deficiencies and of odd weak exceedences. St000889The number of alternating sign matrices with the same antidiagonal sums. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001812The biclique partition number of a graph.
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!