searching the database
Your data matches 28 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: St000240
(load all 5 compositions to match this statistic)
(load all 5 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]
=> [2,1] => 1
[1,0,1,0]
=> [3,1,2] => 3
[1,1,0,0]
=> [2,3,1] => 1
[1,0,1,0,1,0]
=> [4,1,2,3] => 4
[1,0,1,1,0,0]
=> [3,1,4,2] => 3
[1,1,0,0,1,0]
=> [2,4,1,3] => 3
[1,1,0,1,0,0]
=> [4,3,1,2] => 3
[1,1,1,0,0,0]
=> [2,3,4,1] => 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => 5
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => 4
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => 5
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => 4
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => 3
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => 4
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => 3
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => 4
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => 5
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => 3
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => 3
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => 3
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => 3
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => 6
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => 6
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => 6
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => 6
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => 5
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => 5
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => 4
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => 4
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => 3
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => 4
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 6
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => 6
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => 5
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => 5
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => 5
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => 3
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: St001182
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
St001182: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
St001182: 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,1,0,0]
=> 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 3
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 5
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 4
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 5
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 6
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 6
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 5
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> 5
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> 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,0,0,1,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]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 6
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 6
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 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,0,1,1,0,0,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 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,1,1,1,0,0,0,0,0]
=> 3
Description
Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St000141
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000141: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000141: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => [1,2] => [1,2] => 0 = 1 - 1
[1,0,1,0]
=> [3,1,2] => [3,1,2] => [3,1,2] => 2 = 3 - 1
[1,1,0,0]
=> [2,3,1] => [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [3,4,1,2] => [4,1,3,2] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [3,1,4,2] => [3,1,2,4] => [3,1,2,4] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [4,2,1,3] => [2,4,1,3] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,1,3,2] => [3,4,1,2] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [3,4,5,1,2] => [5,1,4,3,2] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [3,4,1,2,5] => [4,1,3,2,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,5,2,1,4] => [5,2,3,1,4] => 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [3,5,1,4,2] => [4,5,1,3,2] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,1,2,4,5] => [3,1,2,4,5] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [4,2,5,1,3] => [2,5,1,4,3] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [4,2,1,3,5] => [2,4,1,3,5] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [4,5,3,1,2] => [3,5,1,4,2] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [4,5,1,3,2] => [5,1,3,4,2] => 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [4,1,3,2,5] => [3,4,1,2,5] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => [2,3,5,1,4] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [5,2,1,4,3] => [2,4,5,1,3] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [5,1,3,4,2] => [3,4,5,1,2] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [3,4,5,6,1,2] => [6,1,5,4,3,2] => 5 = 6 - 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,4,3,2,6] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [3,4,6,2,1,5] => [6,2,4,3,1,5] => 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [3,4,6,1,5,2] => [5,6,1,4,3,2] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [3,4,1,2,5,6] => [4,1,3,2,5,6] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,5,2,6,1,4] => [6,2,3,1,5,4] => 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,5,2,1,4,6] => [5,2,3,1,4,6] => 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [3,5,6,4,1,2] => [4,6,1,5,3,2] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [3,5,6,1,4,2] => [6,1,4,5,3,2] => 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [3,5,1,4,2,6] => [4,5,1,3,2,6] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,6,2,4,1,5] => [4,6,2,3,1,5] => 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [3,6,2,1,5,4] => [5,6,2,3,1,4] => 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [3,6,1,4,5,2] => [4,5,6,1,3,2] => 3 = 4 - 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,2,4,5,6] => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [4,2,5,6,1,3] => [2,6,1,5,4,3] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [4,2,5,1,3,6] => [2,5,1,4,3,6] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,2,6,3,1,5] => [2,6,3,4,1,5] => 4 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [4,2,6,1,5,3] => [2,5,6,1,4,3] => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [4,2,1,3,5,6] => [2,4,1,3,5,6] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [4,5,3,6,1,2] => [3,6,1,5,4,2] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [4,5,3,1,2,6] => [3,5,1,4,2,6] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [4,5,6,3,1,2] => [6,3,5,1,4,2] => 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [4,5,6,1,2,3] => [6,1,5,2,4,3] => 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [4,5,1,3,2,6] => [5,1,3,4,2,6] => 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [4,6,3,2,1,5] => [3,6,2,4,1,5] => 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [4,6,3,1,5,2] => [3,5,6,1,4,2] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [4,6,1,3,5,2] => [5,6,1,3,4,2] => 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [4,1,3,2,5,6] => [3,4,1,2,5,6] => 2 = 3 - 1
Description
The maximum drop size of a permutation.
The maximum drop size of a permutation $\pi$ of $[n]=\{1,2,\ldots, n\}$ is defined to be the maximum value of $i-\pi(i)$.
Matching statistic: St000235
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
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%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
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%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> [2,1] => 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 2 = 3 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [5,2,3,4,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,3,5,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5,2,4,3,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [6,2,3,4,5,1] => 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [5,2,3,4,6,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [4,2,3,6,5,1] => 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [6,2,3,5,4,1] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [4,2,3,5,6,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,6,4,5,1] => 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [3,2,5,4,6,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [6,2,4,3,5,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [6,2,5,4,3,1] => 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [5,2,4,3,6,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,2,4,6,5,1] => 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,2,6,5,4,1] => 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [6,2,4,5,3,1] => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,2,4,5,6,1] => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [2,6,3,4,5,1] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [2,5,3,4,6,1] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,4,3,6,5,1] => 4 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,6,3,5,4,1] => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,4,3,5,6,1] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [6,3,2,4,5,1] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [5,3,2,4,6,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [6,4,3,2,5,1] => 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [6,5,3,4,2,1] => 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,4,3,2,6,1] => 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [4,3,2,6,5,1] => 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [6,3,2,5,4,1] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [6,4,3,5,2,1] => 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [4,3,2,5,6,1] => 2 = 3 - 1
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: St000316
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000316: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000316: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => [1,2] => [1,2] => 0 = 1 - 1
[1,0,1,0]
=> [3,1,2] => [3,1,2] => [3,1,2] => 2 = 3 - 1
[1,1,0,0]
=> [2,3,1] => [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [3,4,1,2] => [4,1,3,2] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [3,1,4,2] => [3,1,2,4] => [3,1,2,4] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [4,2,1,3] => [2,4,1,3] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,1,3,2] => [3,4,1,2] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [3,4,5,1,2] => [5,1,4,3,2] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [3,4,1,2,5] => [4,1,3,2,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,5,2,1,4] => [5,2,3,1,4] => 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [3,5,1,4,2] => [4,5,1,3,2] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,1,2,4,5] => [3,1,2,4,5] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [4,2,5,1,3] => [2,5,1,4,3] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [4,2,1,3,5] => [2,4,1,3,5] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [4,5,3,1,2] => [3,5,1,4,2] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [4,5,1,3,2] => [5,1,3,4,2] => 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [4,1,3,2,5] => [3,4,1,2,5] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => [2,3,5,1,4] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [5,2,1,4,3] => [2,4,5,1,3] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [5,1,3,4,2] => [3,4,5,1,2] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [3,4,5,6,1,2] => [6,1,5,4,3,2] => 5 = 6 - 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,4,3,2,6] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [3,4,6,2,1,5] => [6,2,4,3,1,5] => 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [3,4,6,1,5,2] => [5,6,1,4,3,2] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [3,4,1,2,5,6] => [4,1,3,2,5,6] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,5,2,6,1,4] => [6,2,3,1,5,4] => 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,5,2,1,4,6] => [5,2,3,1,4,6] => 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [3,5,6,4,1,2] => [4,6,1,5,3,2] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [3,5,6,1,4,2] => [6,1,4,5,3,2] => 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [3,5,1,4,2,6] => [4,5,1,3,2,6] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,6,2,4,1,5] => [4,6,2,3,1,5] => 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [3,6,2,1,5,4] => [5,6,2,3,1,4] => 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [3,6,1,4,5,2] => [4,5,6,1,3,2] => 3 = 4 - 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,2,4,5,6] => 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [4,2,5,6,1,3] => [2,6,1,5,4,3] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [4,2,5,1,3,6] => [2,5,1,4,3,6] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,2,6,3,1,5] => [2,6,3,4,1,5] => 4 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [4,2,6,1,5,3] => [2,5,6,1,4,3] => 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [4,2,1,3,5,6] => [2,4,1,3,5,6] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [4,5,3,6,1,2] => [3,6,1,5,4,2] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [4,5,3,1,2,6] => [3,5,1,4,2,6] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [4,5,6,3,1,2] => [6,3,5,1,4,2] => 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [4,5,6,1,2,3] => [6,1,5,2,4,3] => 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [4,5,1,3,2,6] => [5,1,3,4,2,6] => 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [4,6,3,2,1,5] => [3,6,2,4,1,5] => 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [4,6,3,1,5,2] => [3,5,6,1,4,2] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [4,6,1,3,5,2] => [5,6,1,3,4,2] => 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [4,1,3,2,5,6] => [3,4,1,2,5,6] => 2 = 3 - 1
Description
The number of non-left-to-right-maxima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a **non-left-to-right-maximum** if there exists a $j < i$ such that $\sigma_j > \sigma_i$.
Matching statistic: St001504
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St001504: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St001504: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [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,1,1,1,1,0,0,0,0,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> 7 = 6 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [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,1,1,1,0,0,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 7 = 6 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [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,0,1,1,1,0,0,0]
=> 7 = 6 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [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,1,1,0,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> 7 = 6 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [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,1,1,0,0,0,1,1,0,0]
=> 7 = 6 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [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,0,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
Description
The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000831
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00126: Permutations —cactus evacuation⟶ Permutations
St000831: Permutations ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00126: Permutations —cactus evacuation⟶ Permutations
St000831: Permutations ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,2] => [1,2] => 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => [2,3,1] => 2 = 3 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [3,4,2,1] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [2,3,1,4] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [1,3,4,2] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [2,3,4,1] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [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,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [4,5,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [3,4,2,1,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [2,4,3,5,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [3,4,2,5,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [2,3,1,4,5] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => [1,4,5,3,2] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,4,1,2,5] => [3,4,5,1,2] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => [2,4,5,3,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,2,1,4,5] => [3,4,5,2,1] => 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [2,3,1,4,5] => [2,3,4,1,5] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,3,5] => [1,2,4,5,3] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [3,1,2,4,5] => [1,3,4,5,2] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [2,1,3,4,5] => [2,3,4,5,1] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [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,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] => [5,6,4,3,2,1] => 5 = 6 - 1
[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,5,3,2,1,6] => 4 = 5 - 1
[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] => [3,5,4,2,6,1] => 5 = 6 - 1
[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] => [4,5,3,2,6,1] => 4 = 5 - 1
[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] => [3,4,2,1,5,6] => 3 = 4 - 1
[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] => [2,5,4,6,3,1] => 5 = 6 - 1
[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] => [4,5,2,6,1,3] => 4 = 5 - 1
[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] => [3,5,4,6,2,1] => 4 = 5 - 1
[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] => [4,5,3,6,2,1] => 5 = 6 - 1
[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] => [3,4,2,5,1,6] => 3 = 4 - 1
[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,5,3,4,6,1] => 4 = 5 - 1
[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] => [2,4,3,5,6,1] => 4 = 5 - 1
[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] => [3,4,2,5,6,1] => 3 = 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,3,4,5,1,6] => [2,3,1,4,5,6] => 2 = 3 - 1
[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] => [1,5,6,4,3,2] => 4 = 5 - 1
[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,5,6,3,1,2] => 3 = 4 - 1
[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] => [3,5,6,1,4,2] => 4 = 5 - 1
[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] => [4,5,6,1,3,2] => 3 = 4 - 1
[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] => [3,4,5,1,2,6] => 2 = 3 - 1
[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] => [2,5,6,4,3,1] => 4 = 5 - 1
[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] => [4,5,6,2,1,3] => 3 = 4 - 1
[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] => [3,5,6,4,2,1] => 5 = 6 - 1
[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,5,6,3,2,1] => 5 = 6 - 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,2,1,5,6] => [3,4,5,2,1,6] => 4 = 5 - 1
[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] => [2,3,5,4,6,1] => 4 = 5 - 1
[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,4,5,3,6,1] => 3 = 4 - 1
[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,4,5,2,6,1] => 4 = 5 - 1
[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] => [2,3,4,1,5,6] => 2 = 3 - 1
[]
=> [1,0]
=> [1] => [1] => ? = 1 - 1
Description
The number of indices that are either descents or recoils.
This is, for a permutation $\pi$ of length $n$, this statistics counts the set
$$\{ 1 \leq i < n : \pi(i) > \pi(i+1) \text{ or } \pi^{-1}(i) > \pi^{-1}(i+1)\}.$$
Matching statistic: St001279
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001279: Integer partitions ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001279: Integer partitions ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [2] => [2]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1] => [1,1]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3] => [3]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => [2,1]
=> 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => [2,1]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1] => [2,1]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => [4]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [2,2]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [3,1]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,1,1]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [3,1]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [2,1,1]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [2,1,1]
=> 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => [5]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [4,1]
=> 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => [3,2]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => [4,1]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,2,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [2,1,1,1]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => [4,1]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [3,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [3,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,1,1,1]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => [4,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [3,1,1]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => [3,2]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [3,2]
=> 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [3,1,1]
=> 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> 2 = 3 - 1
[]
=> []
=> [] => ?
=> ? = 1 - 1
Description
The sum of the parts of an integer partition that are at least two.
Matching statistic: St000673
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000673: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000673: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●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 = 3 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 2 = 3 - 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,0,1,0,1,0,0]
=> [2,3,4,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 4 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 2 = 3 - 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,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 5 = 6 - 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] => 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 5 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 3 = 4 - 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] => 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 4 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 3 = 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 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3 = 4 - 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] => 4 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 3 = 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] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 2 = 3 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 3 = 4 - 1
[]
=> []
=> [] => ? = 1 - 1
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: St000896
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00063: Permutations —to alternating sign matrix⟶ Alternating sign matrices
St000896: Alternating sign matrices ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00063: Permutations —to alternating sign matrix⟶ Alternating sign matrices
St000896: Alternating sign matrices ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [[1]]
=> ? = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [[0,1],[1,0]]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [[1,0],[0,1]]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [[0,0,1],[1,0,0],[0,1,0]]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [[0,1,0],[1,0,0],[0,0,1]]
=> 2 = 3 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [[1,0,0],[0,0,1],[0,1,0]]
=> 2 = 3 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [[0,0,1],[0,1,0],[1,0,0]]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [[1,0,0],[0,1,0],[0,0,1]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [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 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [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 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [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 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [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 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [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 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [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 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [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 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [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 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [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 = 5 - 1
[1,1,0,1,1,0,0,0]
=> [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 = 3 - 1
[1,1,1,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 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [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 = 3 - 1
[1,1,1,0,1,0,0,0]
=> [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 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [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 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [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 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [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 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [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 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [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 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [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 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [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 = 6 - 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,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [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 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [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 = 6 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [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 = 4 - 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,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 4 = 5 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [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 = 5 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [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 = 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] => [[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 = 3 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [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 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [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 = 4 - 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] => [[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 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [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 = 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,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 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => [[0,0,0,0,1],[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => [[0,0,0,1,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => [[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0]]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => [[0,0,0,0,1],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0]]
=> 5 = 6 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => [[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1]]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => [[0,0,0,0,1],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => [[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[1,0,0,0,0]]
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [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 = 3 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [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 = 4 - 1
[]
=> []
=> [] => []
=> ? = 1 - 1
Description
The number of zeros on the main diagonal of an alternating sign matrix.
The following 18 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000238The number of indices that are not small weak excedances. St000670The reversal length of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001060The distinguishing index of a graph. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000062The length of the longest increasing subsequence of the permutation. 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. St000495The number of inversions of distance at most 2 of a permutation. St000824The sum of the number of descents and the number of recoils of a permutation. St000836The number of descents of distance 2 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)$. St001713The difference of the first and last value in the first row of the Gelfand-Tsetlin pattern. St001812The biclique partition number of a graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001330The hat guessing 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!