Your data matches 185 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001113
(load all 22 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
St001113: 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]
 => 0
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 0
[1,1,0,0]
 => [1,1,1,0,0,0]
 => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,0,0]
 => 0
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 0
[1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,0,0,0]
 => 0
[1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 1
[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]
 => 0
[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]
 => 1
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 1
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => [1,0,1,0,1,0,1,1,1,0,0,0]
 => 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,0,1,0,1,1,0,0,1,1,0,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,0,1,1,0,0,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,1,1,0,0,0,0]
 => [1,0,1,0,1,1,1,1,0,0,0,0]
 => 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,0,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,1,0,0,1,1,1,0,0,0]
 => 0
[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]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,1,0,0,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [1,0,1,1,0,1,1,1,0,0,0,0]
 => 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => [1,0,1,1,1,0,0,0,1,1,0,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,1,1,0,0,1,1,0,0,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,1,1,0,1,1,0,0,0,0]
 => 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [1,0,1,1,1,1,1,0,0,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]
 => [1,1,0,0,1,0,1,0,1,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,1,0,0,1,0,1,1,1,0,0,0]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 0
[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]
 => 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => 2
[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]
 => 1
[1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => [1,1,0,1,1,0,0,0,1,1,0,0]
 => 0
[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]
 => 0
[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]
 => 1
[1,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,1,1,0,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => 0
Description
Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra.
Matching statistic: St001906
(load all 15 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St001906: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1,1,0,0]
 => [1,2] => [1,2] => 0
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [3,1,2] => [3,1,2] => 0
[1,1,0,0]
 => [1,1,1,0,0,0]
 => [1,2,3] => [1,3,2] => 0
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [3,4,1,2] => [3,4,1,2] => 1
[1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [3,1,2,4] => [3,1,4,2] => 0
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,4,2,3] => [1,4,3,2] => 0
[1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [4,1,2,3] => [4,1,3,2] => 0
[1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [1,2,3,4] => [1,4,3,2] => 0
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [3,4,5,1,2] => [3,5,4,1,2] => 1
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [3,4,1,2,5] => [3,5,1,4,2] => 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [3,1,5,2,4] => [3,1,5,4,2] => 0
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [3,5,1,2,4] => [3,5,1,4,2] => 1
[1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [3,1,2,4,5] => [3,1,5,4,2] => 0
[1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,4,5,2,3] => [1,5,4,3,2] => 0
[1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,4,2,3,5] => [1,5,4,3,2] => 0
[1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [4,1,5,2,3] => [4,1,5,3,2] => 0
[1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [4,5,1,2,3] => [4,5,1,3,2] => 1
[1,1,0,1,1,0,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [4,1,2,3,5] => [4,1,5,3,2] => 0
[1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,2,5,3,4] => [1,5,4,3,2] => 0
[1,1,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,5,2,3,4] => [1,5,4,3,2] => 0
[1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [5,1,2,3,4] => [5,1,4,3,2] => 0
[1,1,1,1,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,2,3,4,5] => [1,5,4,3,2] => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [3,4,5,6,1,2] => [3,6,5,4,1,2] => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => [3,4,5,1,2,6] => [3,6,5,1,4,2] => 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [3,4,1,6,2,5] => [3,6,1,5,4,2] => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => [3,4,6,1,2,5] => [3,6,5,1,4,2] => 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,1,2,5,6] => [3,6,1,5,4,2] => 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => [3,1,5,6,2,4] => [3,1,6,5,4,2] => 0
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,1,0,0,1,1,0,0,0]
 => [3,1,5,2,4,6] => [3,1,6,5,4,2] => 0
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => [3,5,1,6,2,4] => [3,6,1,5,4,2] => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => [3,5,6,1,2,4] => [3,6,5,1,4,2] => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [3,5,1,2,4,6] => [3,6,1,5,4,2] => 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => [3,1,2,6,4,5] => [3,1,6,5,4,2] => 0
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => [3,1,6,2,4,5] => [3,1,6,5,4,2] => 0
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => [3,6,1,2,4,5] => [3,6,1,5,4,2] => 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [3,1,2,4,5,6] => [3,1,6,5,4,2] => 0
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,4,5,6,2,3] => [1,6,5,4,3,2] => 0
[1,1,0,0,1,0,1,1,0,0]
 => [1,1,1,0,0,1,0,1,1,0,0,0]
 => [1,4,5,2,3,6] => [1,6,5,4,3,2] => 0
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,4,2,6,3,5] => [1,6,5,4,3,2] => 0
[1,1,0,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,1,0,1,0,0,0]
 => [1,4,6,2,3,5] => [1,6,5,4,3,2] => 0
[1,1,0,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,1,1,0,0,0,0]
 => [1,4,2,3,5,6] => [1,6,5,4,3,2] => 0
[1,1,0,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => [4,1,5,6,2,3] => [4,1,6,5,3,2] => 0
[1,1,0,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,1,0,0,0]
 => [4,1,5,2,3,6] => [4,1,6,5,3,2] => 0
[1,1,0,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => [4,5,1,6,2,3] => [4,6,1,5,3,2] => 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [4,5,6,1,2,3] => [4,6,5,1,3,2] => 2
[1,1,0,1,0,1,1,0,0,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => [4,5,1,2,3,6] => [4,6,1,5,3,2] => 1
[1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => [4,1,2,6,3,5] => [4,1,6,5,3,2] => 0
[1,1,0,1,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,1,0,0,0]
 => [4,1,6,2,3,5] => [4,1,6,5,3,2] => 0
[1,1,0,1,1,0,1,0,0,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => [4,6,1,2,3,5] => [4,6,1,5,3,2] => 1
[1,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,1,1,0,0,0,0,0]
 => [4,1,2,3,5,6] => [4,1,6,5,3,2] => 0
Description
Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. Let $\pi$ be a permutation. Its total displacement [[St000830]] is $D(\pi) = \sum_i |\pi(i) - i|$, and its absolute length [[St000216]] is the minimal number $T(\pi)$ of transpositions whose product is $\pi$. Finally, let $I(\pi)$ be the number of inversions [[St000018]] of $\pi$. This statistic equals $\left(D(\pi)-T(\pi)-I(\pi)\right)/2$. Diaconis and Graham [1] proved that this statistic is always nonnegative.
Matching statistic: St000036
(load all 4 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000036: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1,1,0,0]
 => [1,2] => [1,2] => 1 = 0 + 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [3,1,2] => [3,1,2] => 1 = 0 + 1
[1,1,0,0]
 => [1,1,1,0,0,0]
 => [1,2,3] => [1,3,2] => 1 = 0 + 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [3,4,1,2] => [3,4,1,2] => 2 = 1 + 1
[1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [3,1,2,4] => [3,1,4,2] => 1 = 0 + 1
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,4,2,3] => [1,4,3,2] => 1 = 0 + 1
[1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [4,1,2,3] => [4,1,3,2] => 1 = 0 + 1
[1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [1,2,3,4] => [1,4,3,2] => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [3,4,5,1,2] => [3,5,4,1,2] => 2 = 1 + 1
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [3,4,1,2,5] => [3,5,1,4,2] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [3,1,5,2,4] => [3,1,5,4,2] => 1 = 0 + 1
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [3,5,1,2,4] => [3,5,1,4,2] => 2 = 1 + 1
[1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [3,1,2,4,5] => [3,1,5,4,2] => 1 = 0 + 1
[1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,4,5,2,3] => [1,5,4,3,2] => 1 = 0 + 1
[1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,4,2,3,5] => [1,5,4,3,2] => 1 = 0 + 1
[1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [4,1,5,2,3] => [4,1,5,3,2] => 1 = 0 + 1
[1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [4,5,1,2,3] => [4,5,1,3,2] => 2 = 1 + 1
[1,1,0,1,1,0,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [4,1,2,3,5] => [4,1,5,3,2] => 1 = 0 + 1
[1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,2,5,3,4] => [1,5,4,3,2] => 1 = 0 + 1
[1,1,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,5,2,3,4] => [1,5,4,3,2] => 1 = 0 + 1
[1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [5,1,2,3,4] => [5,1,4,3,2] => 1 = 0 + 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,5,4,3,2] => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [3,4,5,6,1,2] => [3,6,5,4,1,2] => 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => [3,4,5,1,2,6] => [3,6,5,1,4,2] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [3,4,1,6,2,5] => [3,6,1,5,4,2] => 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => [3,4,6,1,2,5] => [3,6,5,1,4,2] => 2 = 1 + 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,1,2,5,6] => [3,6,1,5,4,2] => 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => [3,1,5,6,2,4] => [3,1,6,5,4,2] => 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,1,0,0,1,1,0,0,0]
 => [3,1,5,2,4,6] => [3,1,6,5,4,2] => 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => [3,5,1,6,2,4] => [3,6,1,5,4,2] => 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => [3,5,6,1,2,4] => [3,6,5,1,4,2] => 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [3,5,1,2,4,6] => [3,6,1,5,4,2] => 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => [3,1,2,6,4,5] => [3,1,6,5,4,2] => 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => [3,1,6,2,4,5] => [3,1,6,5,4,2] => 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => [3,6,1,2,4,5] => [3,6,1,5,4,2] => 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [3,1,2,4,5,6] => [3,1,6,5,4,2] => 1 = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,4,5,6,2,3] => [1,6,5,4,3,2] => 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
 => [1,1,1,0,0,1,0,1,1,0,0,0]
 => [1,4,5,2,3,6] => [1,6,5,4,3,2] => 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,4,2,6,3,5] => [1,6,5,4,3,2] => 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,1,0,1,0,0,0]
 => [1,4,6,2,3,5] => [1,6,5,4,3,2] => 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,1,1,0,0,0,0]
 => [1,4,2,3,5,6] => [1,6,5,4,3,2] => 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => [4,1,5,6,2,3] => [4,1,6,5,3,2] => 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,1,0,0,0]
 => [4,1,5,2,3,6] => [4,1,6,5,3,2] => 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => [4,5,1,6,2,3] => [4,6,1,5,3,2] => 2 = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [4,5,6,1,2,3] => [4,6,5,1,3,2] => 3 = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => [4,5,1,2,3,6] => [4,6,1,5,3,2] => 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => [4,1,2,6,3,5] => [4,1,6,5,3,2] => 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,1,0,0,0]
 => [4,1,6,2,3,5] => [4,1,6,5,3,2] => 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => [4,6,1,2,3,5] => [4,6,1,5,3,2] => 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,1,1,0,0,0,0,0]
 => [4,1,2,3,5,6] => [4,1,6,5,3,2] => 1 = 0 + 1
Description
The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. These are multiplicities of Verma modules.
Matching statistic: St001022
(load all 2 compositions to match this statistic)
Mapping
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1,0,0]
 => [1,2] => [1,0,1,0]
 => 0
[1,1,0,0]
 => [1,0,1,0]
 => [2,1] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,2,3] => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => [2,1,3] => [1,1,0,0,1,0]
 => 0
[1,1,0,0,1,0]
 => [1,0,1,0,1,0]
 => [3,2,1] => [1,1,1,0,0,0]
 => 0
[1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [2,3,1] => [1,1,0,1,0,0]
 => 0
[1,1,1,0,0,0]
 => [1,1,0,0,1,0]
 => [3,1,2] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,2,3,4] => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [2,1,3,4] => [1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [3,2,1,4] => [1,1,1,0,0,0,1,0]
 => 0
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [2,3,1,4] => [1,1,0,1,0,0,1,0]
 => 1
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [3,1,2,4] => [1,1,1,0,0,0,1,0]
 => 0
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => [4,2,3,1] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [4,3,2,1] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => [3,2,4,1] => [1,1,1,0,0,1,0,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [1,0,1,1,1,0,0,0]
 => [2,3,4,1] => [1,1,0,1,0,1,0,0]
 => 1
[1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,0]
 => [3,4,2,1] => [1,1,1,0,1,0,0,0]
 => 0
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,0,0,1,0]
 => [4,2,1,3] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [4,3,1,2] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,1,0,1,0,0,0]
 => [1,1,0,0,1,1,0,0]
 => [3,4,1,2] => [1,1,1,0,1,0,0,0]
 => 0
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,0,0,1,0]
 => [4,1,2,3] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [4,2,3,1,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [3,2,4,1,5] => [1,1,1,0,0,1,0,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [3,4,2,1,5] => [1,1,1,0,1,0,0,0,1,0]
 => 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [4,2,1,3,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [4,3,1,2,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
 => 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [4,2,3,5,1] => [1,1,1,1,0,0,0,1,0,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [4,3,2,5,1] => [1,1,1,1,0,0,0,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [3,2,4,5,1] => [1,1,1,0,0,1,0,1,0,0]
 => 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
 => 2
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [3,4,2,5,1] => [1,1,1,0,1,0,0,1,0,0]
 => 1
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
 => 0
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
 => 0
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
 => 1
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
 => 0
[]
 => []
 => [] => []
 => ? = 0
Description
Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001181
(load all 3 compositions to match this statistic)
Mapping
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001181: Dyck paths ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1,0,0]
 => [1,2] => [1,0,1,0]
 => 0
[1,1,0,0]
 => [1,0,1,0]
 => [2,1] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,2,3] => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => [2,1,3] => [1,1,0,0,1,0]
 => 0
[1,1,0,0,1,0]
 => [1,0,1,0,1,0]
 => [3,2,1] => [1,1,1,0,0,0]
 => 0
[1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [2,3,1] => [1,1,0,1,0,0]
 => 0
[1,1,1,0,0,0]
 => [1,1,0,0,1,0]
 => [3,1,2] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,2,3,4] => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [2,1,3,4] => [1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [3,2,1,4] => [1,1,1,0,0,0,1,0]
 => 0
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [2,3,1,4] => [1,1,0,1,0,0,1,0]
 => 1
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [3,1,2,4] => [1,1,1,0,0,0,1,0]
 => 0
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => [4,2,3,1] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [4,3,2,1] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => [3,2,4,1] => [1,1,1,0,0,1,0,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [1,0,1,1,1,0,0,0]
 => [2,3,4,1] => [1,1,0,1,0,1,0,0]
 => 1
[1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,0]
 => [3,4,2,1] => [1,1,1,0,1,0,0,0]
 => 0
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,0,0,1,0]
 => [4,2,1,3] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [4,3,1,2] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,1,0,1,0,0,0]
 => [1,1,0,0,1,1,0,0]
 => [3,4,1,2] => [1,1,1,0,1,0,0,0]
 => 0
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,0,0,1,0]
 => [4,1,2,3] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [4,2,3,1,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [3,2,4,1,5] => [1,1,1,0,0,1,0,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [3,4,2,1,5] => [1,1,1,0,1,0,0,0,1,0]
 => 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [4,2,1,3,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [4,3,1,2,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
 => 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [4,2,3,5,1] => [1,1,1,1,0,0,0,1,0,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [4,3,2,5,1] => [1,1,1,1,0,0,0,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [3,2,4,5,1] => [1,1,1,0,0,1,0,1,0,0]
 => 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
 => 2
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [3,4,2,5,1] => [1,1,1,0,1,0,0,1,0,0]
 => 1
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
 => 0
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
 => 0
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
 => 1
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
 => 0
[]
 => []
 => [] => []
 => ? = 0
Description
Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra.
Matching statistic: St001186
(load all 3 compositions to match this statistic)
Mapping
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001186: Dyck paths ⟶ ℤResult quality: 98% ●values known / values provided: 98%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1,0,0]
 => [1,2] => [1,0,1,0]
 => 0
[1,1,0,0]
 => [1,0,1,0]
 => [2,1] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => [1,2,3] => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => [2,1,3] => [1,1,0,0,1,0]
 => 0
[1,1,0,0,1,0]
 => [1,0,1,0,1,0]
 => [3,2,1] => [1,1,1,0,0,0]
 => 0
[1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [2,3,1] => [1,1,0,1,0,0]
 => 0
[1,1,1,0,0,0]
 => [1,1,0,0,1,0]
 => [3,1,2] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => [1,2,3,4] => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [2,1,3,4] => [1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [3,2,1,4] => [1,1,1,0,0,0,1,0]
 => 0
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [2,3,1,4] => [1,1,0,1,0,0,1,0]
 => 1
[1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => [3,1,2,4] => [1,1,1,0,0,0,1,0]
 => 0
[1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => [4,2,3,1] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => [4,3,2,1] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => [3,2,4,1] => [1,1,1,0,0,1,0,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [1,0,1,1,1,0,0,0]
 => [2,3,4,1] => [1,1,0,1,0,1,0,0]
 => 1
[1,1,0,1,1,0,0,0]
 => [1,0,1,0,1,1,0,0]
 => [3,4,2,1] => [1,1,1,0,1,0,0,0]
 => 0
[1,1,1,0,0,0,1,0]
 => [1,1,0,1,0,0,1,0]
 => [4,2,1,3] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => [4,3,1,2] => [1,1,1,1,0,0,0,0]
 => 0
[1,1,1,0,1,0,0,0]
 => [1,1,0,0,1,1,0,0]
 => [3,4,1,2] => [1,1,1,0,1,0,0,0]
 => 0
[1,1,1,1,0,0,0,0]
 => [1,1,1,0,0,0,1,0]
 => [4,1,2,3] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [4,2,3,1,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [3,2,4,1,5] => [1,1,1,0,0,1,0,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [3,4,2,1,5] => [1,1,1,0,1,0,0,0,1,0]
 => 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [4,2,1,3,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [4,3,1,2,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
 => 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
 => 0
[1,1,0,0,1,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,0,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
 => 0
[1,1,0,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => [4,2,3,5,1] => [1,1,1,1,0,0,0,1,0,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => [4,3,2,5,1] => [1,1,1,1,0,0,0,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => [3,2,4,5,1] => [1,1,1,0,0,1,0,1,0,0]
 => 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
 => 2
[1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => [3,4,2,5,1] => [1,1,1,0,1,0,0,1,0,0]
 => 1
[1,1,0,1,1,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
 => 0
[1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
 => 0
[1,1,0,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
 => 1
[1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
 => 0
[]
 => []
 => [] => []
 => ? = 0
Description
Number of simple modules with grade at least 3 in the corresponding Nakayama algebra.
Matching statistic: St001964
(load all 4 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St001964: Posets ⟶ ℤResult quality: 51% ●values known / values provided: 51%●distinct values known / distinct values provided: 67%
Values
[1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => ([(0,1)],2)
 => 0
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => ([(0,2),(2,1)],3)
 => 0
[1,1,0,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => ([(0,2),(2,1)],3)
 => 0
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,0,1,1,1,0,0,0]
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 1
[1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,0,1,0,1,1,0,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => ? = 1
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => ? = 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ? = 0
[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]
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ? = 1
[1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,0,0,1,0]
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ? = 0
[1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ? = 1
[1,1,0,1,1,0,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,1,0,0,1,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,1,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => ([(0,5),(1,8),(2,7),(3,2),(3,6),(4,1),(4,6),(5,3),(5,4),(6,7),(6,8),(7,9),(8,9)],10)
 => ? = 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => ? = 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,1,1,0,0,1,0,0,0]
 => ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
 => ? = 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,1,1,0,0,0,0]
 => ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
 => ? = 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,1,1,0,0,0,0]
 => [1,0,1,1,1,0,1,0,1,0,0,0]
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => ? = 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,0,0,1,0,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 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,1,1,0,1,0,0,1,0,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 0
[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,1,0,0,1,1,0,0,0]
 => ([(0,5),(1,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8)
 => ? = 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => [1,0,1,1,0,1,1,1,0,0,0,0]
 => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
 => ? = 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [1,0,1,1,0,1,1,0,1,0,0,0]
 => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
 => ? = 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,1,0,0]
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => ? = 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,1,0,1,1,0,0,1,0,0]
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ? = 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,1,0,1,0,1,1,0,0,0]
 => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
 => ? = 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [1,0,1,1,0,1,0,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,0,0,0,1,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 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,1,0,1,0,0,0,1,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 0
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,0,1,1,1,0,0,1,0,0,1,0]
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => ? = 0
[1,1,0,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,1,0,1,0,0,0]
 => [1,0,1,1,0,1,1,0,0,0,1,0]
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ? = 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,1,0,1,0,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,0,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,0,0,1,1,0,0]
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => ? = 0
[1,1,0,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,1,0,0,0]
 => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
 => ? = 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,1,0,0,0,0]
 => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
 => ? = 2
[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,0,1,1,1,0,1,0,0,0]
 => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
 => ? = 1
[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,0,1,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,1,1,0,0,1,0,0]
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ? = 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,0,1,1,0,1,1,0,0,0]
 => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
 => ? = 1
[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,0,1,1,0,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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]
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => ? = 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,0,1,0,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,0,1,1,0,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,1,0,0,1,0,1,0,0]
 => [1,1,1,1,0,0,1,0,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0,1,0]
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => ? = 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,0,1,1,0,1,0,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,0,1,0,1,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,1,0,1,0,0,1,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,0]
 => [1,0,1,0,1,1,0,0,1,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,1,0,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,1,0,0,0,0]
 => [1,0,1,0,1,0,1,1,1,0,0,0]
 => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
 => ? = 1
[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,0,1,0,1,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,0,1,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,1,0,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,0,1,1,0,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,0,1,0,1,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,0,1,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[]
 => [1,0]
 => [1,0]
 => ([],1)
 => 0
Description
The interval resolution global dimension of a poset. This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.
Matching statistic: St001095
(load all 3 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St001095: Posets ⟶ ℤResult quality: 46% ●values known / values provided: 46%●distinct values known / distinct values provided: 67%
Values
[1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => ([(0,1)],2)
 => 0
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,1,0,1,0,0]
 => ([(0,2),(2,1)],3)
 => 0
[1,1,0,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => ([(0,2),(2,1)],3)
 => 0
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 1
[1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,0,1,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => ([(0,3),(2,1),(3,2)],4)
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
 => ? = 1
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [1,1,1,0,1,0,0,0,1,0]
 => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
 => ? = 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 0
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
 => ? = 1
[1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [1,1,0,1,0,0,1,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => ? = 0
[1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
 => ? = 0
[1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
 => ? = 1
[1,1,0,1,1,0,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [1,1,0,1,0,1,0,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,1,1,1,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,1,1,1,0,1,0,0,0,0,0]
 => ([(0,4),(0,5),(1,9),(2,3),(2,11),(3,8),(4,1),(4,10),(5,2),(5,10),(7,6),(8,6),(9,7),(10,9),(10,11),(11,7),(11,8)],12)
 => ? = 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => ([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
 => ? = 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => ([(0,4),(0,5),(1,6),(3,7),(4,8),(5,1),(5,8),(6,7),(7,2),(8,3),(8,6)],9)
 => ? = 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,1,0,0]
 => ([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
 => ? = 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0,1,0,1,0]
 => ([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
 => ? = 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => ([(0,5),(1,7),(2,8),(3,6),(4,3),(4,8),(5,2),(5,4),(6,7),(8,1),(8,6)],9)
 => ? = 0
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,1,0,0,1,1,0,0,0]
 => [1,1,0,1,1,0,0,1,0,0,1,0]
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => ? = 0
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,1,0,0,0]
 => ([(0,4),(0,5),(1,7),(2,9),(3,6),(4,8),(5,2),(5,8),(6,7),(8,3),(8,9),(9,1),(9,6)],10)
 => ? = 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,0]
 => ([(0,3),(0,5),(1,8),(2,7),(3,6),(4,2),(4,9),(5,4),(5,6),(6,9),(7,8),(9,1),(9,7)],10)
 => ? = 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0]
 => ([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
 => ? = 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => [1,1,0,1,0,0,1,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
 => ? = 0
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => ([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8)
 => ? = 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [1,1,0,1,0,0,1,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => ? = 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,1,0,1,0,0,0,1,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 0
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,1,0,0,1,0,0]
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => 0
[1,1,0,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,1,0,0,1,0,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 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,1,0,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,0,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => ? = 0
[1,1,0,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,0,0,0,1,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 0
[1,1,0,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => ([(0,3),(0,5),(1,8),(2,7),(3,6),(4,2),(4,9),(5,1),(5,6),(6,4),(6,8),(8,9),(9,7)],10)
 => ? = 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,1,0,0,0,0]
 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10)
 => ? = 2
[1,1,0,1,0,1,1,0,0,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => [1,1,1,0,1,0,1,0,0,0,1,0]
 => ([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
 => ? = 1
[1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
 => 0
[1,1,0,1,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,1,0,0,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8)
 => ? = 0
[1,1,0,1,1,0,1,0,0,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => ([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9)
 => ? = 1
[1,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,1,1,0,0,0,0,0]
 => [1,1,0,1,0,1,0,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,1,1,0,1,0,0,0]
 => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
 => ? = 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,0,1,1,0,1,0,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,1,0,1,0,0,0]
 => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
 => ? = 0
[1,1,1,0,0,1,0,1,0,0]
 => [1,1,1,1,0,0,1,0,1,0,0,0]
 => [1,0,1,1,1,0,1,0,1,0,0,0]
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => ? = 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,0,1,0,1,0,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,1,0,1,0,0,0,1,0]
 => [1,1,1,1,0,1,0,0,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
 => ? = 0
[1,1,1,0,1,0,0,1,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9)
 => ? = 0
[1,1,1,0,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,1,0,0,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10)
 => ? = 1
[1,1,1,0,1,1,0,0,0,0]
 => [1,1,1,1,0,1,1,0,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,0,1,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,1,0,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,0,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[1,1,1,1,0,1,0,0,0,0]
 => [1,1,1,1,1,0,1,0,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 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,0,1,0,1,0,1,0,1,0]
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 0
[]
 => [1,0]
 => [1,0]
 => ([],1)
 => ? = 0
Description
The number of non-isomorphic posets with precisely one further covering relation.
Matching statistic: St001491
(load all 3 compositions to match this statistic)
Mapping
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00114: Permutations —connectivity set⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 33% ●values known / values provided: 46%●distinct values known / distinct values provided: 33%
Values
[1,0]
 => [1] => [1] => => ? = 0 + 1
[1,0,1,0]
 => [2,1] => [2,1] => 0 => ? = 0 + 1
[1,1,0,0]
 => [1,2] => [1,2] => 1 => 1 = 0 + 1
[1,0,1,0,1,0]
 => [2,3,1] => [2,3,1] => 00 => ? = 1 + 1
[1,0,1,1,0,0]
 => [2,1,3] => [2,1,3] => 01 => 1 = 0 + 1
[1,1,0,0,1,0]
 => [1,3,2] => [1,3,2] => 10 => 1 = 0 + 1
[1,1,0,1,0,0]
 => [3,1,2] => [3,1,2] => 00 => ? = 0 + 1
[1,1,1,0,0,0]
 => [1,2,3] => [1,3,2] => 10 => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
 => [2,3,4,1] => [2,4,3,1] => 000 => ? = 1 + 1
[1,0,1,0,1,1,0,0]
 => [2,3,1,4] => [2,4,1,3] => 000 => ? = 1 + 1
[1,0,1,1,0,0,1,0]
 => [2,1,4,3] => [2,1,4,3] => 010 => 1 = 0 + 1
[1,0,1,1,0,1,0,0]
 => [2,4,1,3] => [2,4,1,3] => 000 => ? = 1 + 1
[1,0,1,1,1,0,0,0]
 => [2,1,3,4] => [2,1,4,3] => 010 => 1 = 0 + 1
[1,1,0,0,1,0,1,0]
 => [1,3,4,2] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,0,0,1,1,0,0]
 => [1,3,2,4] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,0,1,0,0,1,0]
 => [3,1,4,2] => [3,1,4,2] => 000 => ? = 0 + 1
[1,1,0,1,0,1,0,0]
 => [3,4,1,2] => [3,4,1,2] => 000 => ? = 1 + 1
[1,1,0,1,1,0,0,0]
 => [3,1,2,4] => [3,1,4,2] => 000 => ? = 0 + 1
[1,1,1,0,0,0,1,0]
 => [1,2,4,3] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,1,0,0,1,0,0]
 => [1,4,2,3] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,1,0,1,0,0,0]
 => [4,1,2,3] => [4,1,3,2] => 000 => ? = 0 + 1
[1,1,1,1,0,0,0,0]
 => [1,2,3,4] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
 => [2,3,4,5,1] => [2,5,4,3,1] => 0000 => ? = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
 => [2,3,4,1,5] => [2,5,4,1,3] => 0000 => ? = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
 => [2,3,1,5,4] => [2,5,1,4,3] => 0000 => ? = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
 => [2,3,5,1,4] => [2,5,4,1,3] => 0000 => ? = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
 => [2,3,1,4,5] => [2,5,1,4,3] => 0000 => ? = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
 => [2,1,4,5,3] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,5] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
 => [2,4,1,5,3] => [2,5,1,4,3] => 0000 => ? = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
 => [2,4,5,1,3] => [2,5,4,1,3] => 0000 => ? = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
 => [2,4,1,3,5] => [2,5,1,4,3] => 0000 => ? = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
 => [2,1,3,5,4] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
 => [2,1,5,3,4] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
 => [2,5,1,3,4] => [2,5,1,4,3] => 0000 => ? = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
 => [2,1,3,4,5] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
 => [1,3,4,5,2] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
 => [1,3,4,2,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
 => [1,3,2,5,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
 => [1,3,5,2,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
 => [1,3,2,4,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
 => [3,1,4,5,2] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
 => [3,1,4,2,5] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
 => [3,4,1,5,2] => [3,5,1,4,2] => 0000 => ? = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
 => [3,4,5,1,2] => [3,5,4,1,2] => 0000 => ? = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
 => [3,4,1,2,5] => [3,5,1,4,2] => 0000 => ? = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
 => [3,1,2,5,4] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
 => [3,1,5,2,4] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
 => [3,5,1,2,4] => [3,5,1,4,2] => 0000 => ? = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
 => [3,1,2,4,5] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
 => [1,2,4,5,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
 => [1,2,4,3,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
 => [1,4,2,5,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,1,0,1,0,0]
 => [1,4,5,2,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
 => [1,4,2,3,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,1,0,0,0,1,0]
 => [4,1,2,5,3] => [4,1,5,3,2] => 0000 => ? = 0 + 1
[1,1,1,0,1,0,0,1,0,0]
 => [4,1,5,2,3] => [4,1,5,3,2] => 0000 => ? = 0 + 1
[1,1,1,0,1,0,1,0,0,0]
 => [4,5,1,2,3] => [4,5,1,3,2] => 0000 => ? = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
 => [4,1,2,3,5] => [4,1,5,3,2] => 0000 => ? = 0 + 1
[1,1,1,1,0,0,0,0,1,0]
 => [1,2,3,5,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,1,0,0,0,1,0,0]
 => [1,2,5,3,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,1,0,0,1,0,0,0]
 => [1,5,2,3,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,1,0,1,0,0,0,0]
 => [5,1,2,3,4] => [5,1,4,3,2] => 0000 => ? = 0 + 1
[1,1,1,1,1,0,0,0,0,0]
 => [1,2,3,4,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[]
 => [] => [] => => ? = 0 + 1
Description
The number of indecomposable projective-injective modules in the algebra corresponding to a subset. Let $A_n=K[x]/(x^n)$. We associate to a nonempty subset S of an (n-1)-set the module $M_S$, which is the direct sum of $A_n$-modules with indecomposable non-projective direct summands of dimension $i$ when $i$ is in $S$ (note that such modules have vector space dimension at most n-1). Then the corresponding algebra associated to S is the stable endomorphism ring of $M_S$. We decode the subset as a binary word so that for example the subset $S=\{1,3 \} $ of $\{1,2,3 \}$ is decoded as 101.
Matching statistic: St000264
(load all 12 compositions to match this statistic)
Mapping
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00252: Permutations —restriction⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000264: Graphs ⟶ ℤResult quality: 33% ●values known / values provided: 34%●distinct values known / distinct values provided: 33%
Values
[1,0]
 => [1] => [] => ([],0)
 => ? = 0 + 3
[1,0,1,0]
 => [1,2] => [1] => ([],1)
 => ? = 0 + 3
[1,1,0,0]
 => [2,1] => [1] => ([],1)
 => ? = 0 + 3
[1,0,1,0,1,0]
 => [1,2,3] => [1,2] => ([],2)
 => ? = 1 + 3
[1,0,1,1,0,0]
 => [1,3,2] => [1,2] => ([],2)
 => ? = 0 + 3
[1,1,0,0,1,0]
 => [2,1,3] => [2,1] => ([(0,1)],2)
 => ? = 0 + 3
[1,1,0,1,0,0]
 => [2,3,1] => [2,1] => ([(0,1)],2)
 => ? = 0 + 3
[1,1,1,0,0,0]
 => [3,2,1] => [2,1] => ([(0,1)],2)
 => ? = 0 + 3
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [1,2,3] => ([],3)
 => ? = 1 + 3
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [1,2,3] => ([],3)
 => ? = 1 + 3
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [1,3,2] => ([(1,2)],3)
 => ? = 0 + 3
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [1,3,2] => ([(1,2)],3)
 => ? = 1 + 3
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [1,3,2] => ([(1,2)],3)
 => ? = 0 + 3
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [2,1,3] => ([(1,2)],3)
 => ? = 0 + 3
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [2,1,3] => ([(1,2)],3)
 => ? = 0 + 3
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [2,3,1] => ([(0,2),(1,2)],3)
 => ? = 0 + 3
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [2,3,1] => ([(0,2),(1,2)],3)
 => ? = 1 + 3
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [2,3,1] => ([(0,2),(1,2)],3)
 => ? = 0 + 3
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
 => 3 = 0 + 3
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
 => 3 = 0 + 3
[1,1,1,0,1,0,0,0]
 => [4,2,3,1] => [2,3,1] => ([(0,2),(1,2)],3)
 => ? = 0 + 3
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
 => 3 = 0 + 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [1,2,3,4] => ([],4)
 => ? = 1 + 3
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [1,2,3,4] => ([],4)
 => ? = 1 + 3
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [1,2,4,3] => ([(2,3)],4)
 => ? = 1 + 3
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [1,2,4,3] => ([(2,3)],4)
 => ? = 1 + 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [1,2,4,3] => ([(2,3)],4)
 => ? = 1 + 3
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [1,3,2,4] => ([(2,3)],4)
 => ? = 0 + 3
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [1,3,2,4] => ([(2,3)],4)
 => ? = 0 + 3
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [1,3,4,2] => ([(1,3),(2,3)],4)
 => ? = 1 + 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
 => ? = 1 + 3
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
 => ? = 1 + 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,5,3,4,2] => [1,3,4,2] => ([(1,3),(2,3)],4)
 => ? = 1 + 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [2,1,3,4] => ([(2,3)],4)
 => ? = 0 + 3
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [2,1,3,4] => ([(2,3)],4)
 => ? = 0 + 3
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [2,1,4,3] => ([(0,3),(1,2)],4)
 => ? = 0 + 3
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [2,1,4,3] => ([(0,3),(1,2)],4)
 => ? = 0 + 3
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [2,1,4,3] => ([(0,3),(1,2)],4)
 => ? = 0 + 3
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [2,3,1,4] => ([(1,3),(2,3)],4)
 => ? = 0 + 3
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [2,3,1,4] => ([(1,3),(2,3)],4)
 => ? = 0 + 3
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
 => ? = 1 + 3
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
 => ? = 2 + 3
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
 => ? = 1 + 3
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
 => ? = 1 + 3
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,0,0,1,0,1,0]
 => [3,2,1,4,5] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,0,0,1,1,0,0]
 => [3,2,1,5,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,0,1,0,0,1,0]
 => [3,2,4,1,5] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,0,1,0,1,0,0]
 => [3,2,4,5,1] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,0,1,1,0,0,0]
 => [3,2,5,4,1] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,1,0,0,0,1,0]
 => [4,2,3,1,5] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,1,0,0,1,0,0]
 => [4,2,3,5,1] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,0,1,0,1,0,0,0]
 => [5,2,3,4,1] => [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
 => ? = 1 + 3
[1,1,1,0,1,1,0,0,0,0]
 => [5,2,4,3,1] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,1,0,0,0,0,1,0]
 => [4,3,2,1,5] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,1,0,0,0,1,0,0]
 => [4,3,2,5,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,1,0,0,1,0,0,0]
 => [5,3,2,4,1] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,1,0,1,0,0,0,0]
 => [5,3,4,2,1] => [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[1,1,1,1,1,0,0,0,0,0]
 => [5,4,3,2,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3 = 0 + 3
[]
 => [] => ? => ?
 => ? = 0 + 3
Description
The girth of a graph, which is not a tree. This is the length of the shortest cycle in the graph.
The following 175 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000237The number of small exceedances. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St001490The number of connected components of a skew partition. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000635The number of strictly order preserving maps of a poset into itself. St001890The maximum magnitude of the Möbius function of a poset. St000842The breadth 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)$. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001060The distinguishing index of a graph. St000405The number of occurrences of the pattern 1324 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000534The number of 2-rises of a permutation. St000153The number of adjacent cycles of a permutation. St000451The length of the longest pattern of the form k 1 2. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001866The nesting alignments of a signed permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001498The normalised height of a Nakayama algebra with magnitude 1. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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$. 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$. St000017The number of inversions of a standard tableau. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000488The number of cycles of a permutation of length at most 2. St000649The number of 3-excedences of a permutation. St000731The number of double exceedences of a permutation. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000929The constant term of the character polynomial of an integer partition. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001061The number of indices that are both descents and recoils of a permutation. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001383The BG-rank of an integer partition. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001586The number of odd parts smaller than the largest even part in an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001811The Castelnuovo-Mumford regularity of a permutation. St001856The number of edges in the reduced word graph of a permutation. St001867The number of alignments of type EN of a signed permutation. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001948The number of augmented double ascents of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000618The number of self-evacuating tableaux of given shape. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000781The number of proper colouring schemes of a Ferrers diagram. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001568The smallest positive integer that does not appear twice in the partition. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001768The number of reduced words of a signed permutation. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001857The number of edges in the reduced word graph of a signed permutation. St001344The neighbouring number of a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St000023The number of inner peaks of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000091The descent variation of a composition. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000217The number of occurrences of the pattern 312 in a permutation. St000241The number of cyclical small excedances. St000338The number of pixed points of a permutation. St000357The number of occurrences of the pattern 12-3. St000358The number of occurrences of the pattern 31-2. St000365The number of double ascents of a permutation. St000370The genus of a graph. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000562The number of internal points of a set partition. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000624The normalized sum of the minimal distances to a greater element. St000650The number of 3-rises of a permutation. St000666The number of right tethers of a permutation. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000779The tier of a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000872The number of very big descents of a permutation. St000873The aix statistic of a permutation. St000881The number of short braid edges in the graph of braid moves of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001130The number of two successive successions in a permutation. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001301The first Betti number of the order complex associated with the poset. St001309The number of four-cliques in a graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001411The number of patterns 321 or 3412 in a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001470The cyclic holeyness of a permutation. St001535The number of cyclic alignments of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001781The interlacing number of a set partition. St001871The number of triconnected components of a graph. St000078The number of alternating sign matrices whose left key is the permutation. St000099The number of valleys of a permutation, including the boundary. St000239The number of small weak excedances. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000255The number of reduced Kogan faces with the permutation as type. St000570The Edelman-Greene number of a permutation. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001162The minimum jump of a permutation. St001220The width of a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000236The number of cyclical small weak excedances. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000308The height of the tree associated to a permutation. St000504The cardinality of the first block of a set partition. St000636The hull number of a graph. St000907The number of maximal antichains of minimal length in a poset. St001062The maximal size of a block of a set partition. St001654The monophonic hull number of a graph. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000879The number of long braid edges in the graph of braid moves of a permutation. St001624The breadth of a lattice. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001330The hat guessing number of a graph.