searching the database
Your data matches 117 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: St001182
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
St001182: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[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]
=> 3 = 2 + 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]
=> 4 = 3 + 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]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> 3 = 2 + 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]
=> 5 = 4 + 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]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 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]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> 4 = 3 + 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]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
Description
Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St000235
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing 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,2] => 2
[1,1,0,0]
=> [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => 2
[1,1,0,0,1,0]
=> [2,1,3] => 2
[1,1,0,1,0,0]
=> [2,3,1] => 0
[1,1,1,0,0,0]
=> [3,2,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 3
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 3
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 4
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 3
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 4
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 4
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 4
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 5
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 3
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 2
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 5
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: St000673
(load all 31 compositions to match this statistic)
(load all 31 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000673: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000673: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 2
[1,1,0,0,1,0]
=> [2,1,3] => 2
[1,1,0,1,0,0]
=> [2,3,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 5
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 2
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: St000238
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
St000238: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000238: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [3,1,2] => 3 = 2 + 1
[1,1,0,0]
=> [2,3,1] => 1 = 0 + 1
[1,0,1,0,1,0]
=> [4,1,2,3] => 4 = 3 + 1
[1,0,1,1,0,0]
=> [3,1,4,2] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [2,4,1,3] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [2,3,4,1] => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 6 = 5 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => 5 = 4 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => 3 = 2 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => 4 = 3 + 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 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
St000240: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000240: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [3,1,2] => 3 = 2 + 1
[1,1,0,0]
=> [2,3,1] => 1 = 0 + 1
[1,0,1,0,1,0]
=> [4,1,2,3] => 4 = 3 + 1
[1,0,1,1,0,0]
=> [3,1,4,2] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [2,4,1,3] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [2,3,4,1] => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 6 = 5 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => 5 = 4 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => 3 = 2 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => 4 = 3 + 1
Description
The number of indices that are not small excedances.
A small excedance is an index $i$ for which $\pi_i = i+1$.
Matching statistic: St000896
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00063: Permutations —to alternating sign matrix⟶ Alternating sign matrices
St000896: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00063: Permutations —to alternating sign matrix⟶ Alternating sign matrices
St000896: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [[1,0],[0,1]]
=> 0
[1,1,0,0]
=> [2,1] => [[0,1],[1,0]]
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [[1,0,0],[0,1,0],[0,0,1]]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [[1,0,0],[0,0,1],[0,1,0]]
=> 2
[1,1,0,0,1,0]
=> [2,1,3] => [[0,1,0],[1,0,0],[0,0,1]]
=> 2
[1,1,0,1,0,0]
=> [2,3,1] => [[0,0,1],[1,0,0],[0,1,0]]
=> 3
[1,1,1,0,0,0]
=> [3,2,1] => [[0,0,1],[0,1,0],[1,0,0]]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [[0,0,0,1],[1,0,0,0],[0,0,1,0],[0,1,0,0]]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [[0,0,0,1],[0,1,0,0],[1,0,0,0],[0,0,1,0]]
=> 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [[0,0,0,1],[0,1,0,0],[0,0,1,0],[1,0,0,0]]
=> 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0]]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0]]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[0,0,0,1,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[0,0,0,0,1],[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [[0,0,0,0,1],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [[0,0,0,1,0],[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0]]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0]]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [[0,0,0,0,1],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> 5
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 2
Description
The number of zeros on the main diagonal of an alternating sign matrix.
Matching statistic: St001005
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00239: Permutations —Corteel⟶ Permutations
St001005: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00239: Permutations —Corteel⟶ Permutations
St001005: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 2
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 2
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 2
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,2,3,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,2,4,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => 4
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,4,1,2] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,3,5,2] => 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,5,2,3] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 4
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 5
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 4
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,2,3,5,1] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,2,4,1,5] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,2,5,4,1] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,2,4,5,1] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,2,5,1,3] => 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [2,3,1,4,5] => 3
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 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing 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,0]
=> [1,2] => [1,1]
=> 0
[1,1,0,0]
=> [2,1] => [2]
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,1,1]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> 2
[1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> 2
[1,1,0,1,0,0]
=> [2,3,1] => [3]
=> 3
[1,1,1,0,0,0]
=> [3,2,1] => [2,1]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,1,1,1]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1]
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4]
=> 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,1]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,1,1]
=> 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,1]
=> 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,1,1]
=> 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [2,2]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,1,1,1]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,1,1,1]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,1,1]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [2,1,1,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,1,1,1]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,1]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1]
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,1,1]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [2,1,1,1]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [3,1,1]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [2,1,1,1]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [2,2,1]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,1,1]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,2,1]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,2,1]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,2,1]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,1]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,1]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,1,1]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,1]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,1,1]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [3,2]
=> 5
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [2,1,1,1]
=> 2
Description
The sum of the parts of an integer partition that are at least two.
Matching statistic: St001458
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001458: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St001458: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 2
[1,1,0,0]
=> [1,2] => ([],2)
=> 0
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 2
[1,1,0,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> 0
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
Description
The rank of the adjacency matrix of a graph.
Matching statistic: St001255
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001255: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
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] => [1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,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.
The following 107 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St000141The maximum drop size of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000831The number of indices that are either descents or recoils. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001459The number of zero columns in the nullspace of a graph. St000722The number of different neighbourhoods in a graph. St000868The aid statistic in the sense of Shareshian-Wachs. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St000422The energy of a graph, if it is integral. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001060The distinguishing index of a graph. St000259The diameter of a connected graph. 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$. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St000742The number of big ascents of a permutation after prepending zero. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001388The number of non-attacking neighbors of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001875The number of simple modules with projective dimension at most 1. St000264The girth of a graph, which is not a tree. St000670The reversal length of a permutation. St000438The position of the last up step in a Dyck path. St000454The largest 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. 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$. 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)$. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001769The reflection length of a signed permutation. 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. St001498The normalised height of a Nakayama algebra with magnitude 1. St000137The Grundy value of an integer partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000460The hook length of the last cell along the main diagonal of an integer partition. St000474Dyson's crank of a partition. St000477The weight of a partition according to Alladi. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000933The number of multipartitions of sizes given by 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. St000993The multiplicity of the largest part of an integer partition. St001176The size of a partition minus its first part. St001199The dominant dimension of $eAe$ for 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. St001360The number of covering relations in Young's lattice below a partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St000730The maximal arc length of a set partition. St000836The number of descents of distance 2 of a permutation. St000089The absolute variation of a composition. St000091The descent variation of a composition. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000358The number of occurrences of the pattern 31-2. St000495The number of inversions of distance at most 2 of a permutation. St000711The number of big exceedences of a permutation. St000824The sum of the number of descents and the number of recoils of a permutation. St000837The number of ascents of distance 2 of a permutation. St000961The shifted major index of a permutation. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001638The book thickness of a graph. St001713The difference of the first and last value in the first row of the Gelfand-Tsetlin pattern. St001811The Castelnuovo-Mumford regularity of a permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St000007The number of saliances of the permutation. St000062The length of the longest increasing subsequence of the permutation. St000187The determinant of an alternating sign matrix. St000308The height of the tree associated to a permutation. St000619The number of cyclic descents of a permutation. St000638The number of up-down runs of a permutation. St000886The number of permutations with the same antidiagonal sums. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St000889The number of alternating sign matrices with the same antidiagonal sums.
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!