searching the database
Your data matches 262 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: St001513
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St001513: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
St001513: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [3,1,2] => [1,3,2] => 0
[2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => [2,1,4,3] => 0
[1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => [3,4,1,2] => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [2,3,1,5,4] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => [1,2,4,3] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,4,1,5,2] => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [2,3,4,1,6,5] => 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [1,3,5,2,4] => 0
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [4,2,5,1,3] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [1,5,2,4,3] => 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [3,4,1,5,6,2] => 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [1,3,4,6,2,5] => 0
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [2,1,3,5,4] => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,1,5,2,4] => 0
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [4,1,5,2,3] => 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [1,4,2,6,5,3] => 0
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [7,3,4,5,1,2,6] => [1,3,4,5,7,2,6] => 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [2,1,6,4,3,5] => 0
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [4,3,1,6,2,5] => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [5,2,3,6,1,4] => 0
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [1,2,3,5,4] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [3,6,1,5,2,4] => 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [4,2,5,1,6,3] => 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [5,4,1,6,2,3] => 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [7,1,4,5,6,2,3] => [1,4,2,5,7,6,3] => 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [2,3,1,4,6,5] => 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [1,2,4,6,3,5] => 0
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,4,1,2,6,5] => 0
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [5,1,6,3,2,4] => 0
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [2,6,1,3,5,4] => 0
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [1,2,6,3,5,4] => 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [4,1,5,2,6,3] => 0
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [7,5,4,1,2,3,6] => [1,2,5,7,4,3,6] => 0
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [1,3,2,6,4,5] => 0
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,2,1,6,3,5] => 0
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [1,2,6,4,3,5] => 0
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [5,2,1,6,3,4] => 0
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [5,3,6,1,2,4] => 1
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [1,6,2,3,5,4] => 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [7,1,6,5,2,3,4] => [1,2,7,6,3,5,4] => 1
[5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [7,3,5,1,2,4,6] => [1,3,2,5,7,4,6] => 0
[5,2,1,1]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [7,4,1,5,2,3,6] => [1,4,5,7,2,3,6] => 0
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [2,1,3,4,6,5] => 0
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,1,2,6,4,5] => 0
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [4,1,2,6,3,5] => 0
[4,2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [7,1,4,6,2,3,5] => [1,4,2,3,7,6,5] => 0
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [5,1,2,6,3,4] => 0
[5,4,1]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [7,3,4,1,2,5,6] => [1,3,4,2,7,5,6] => 0
[5,2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [7,1,4,5,2,3,6] => [1,4,2,5,7,3,6] => 0
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [1,2,3,4,6,5] => 0
Description
The number of nested exceedences of a permutation.
For a permutation $\pi$, this is the number of pairs $i,j$ such that $i < j < \pi(j) < \pi(i)$. For exceedences, see [[St000155]].
Matching statistic: St000375
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000375: Permutations ⟶ ℤResult quality: 80% ●values known / values provided: 80%●distinct values known / distinct values provided: 100%
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000375: Permutations ⟶ ℤResult quality: 80% ●values known / values provided: 80%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [3,1,2] => [1,3,2] => 0
[2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => [1,3,4,2] => 0
[1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => [3,4,1,2] => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [1,3,4,5,2] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => [1,2,4,3] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,5,1,2,4] => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [1,3,4,5,6,2] => 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [1,4,2,5,3] => 0
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [4,2,5,1,3] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [2,1,5,4,3] => 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [3,6,1,2,4,5] => 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [1,5,2,3,6,4] => 0
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [1,3,2,5,4] => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,1,4,5,2] => 0
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [2,4,5,1,3] => 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [2,1,6,3,5,4] => 0
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [7,3,4,5,1,2,6] => [1,6,2,3,4,7,5] => ? = 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [1,4,5,2,6,3] => 0
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [4,1,5,3,6,2] => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [5,2,3,6,1,4] => 0
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [1,2,3,5,4] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [4,1,5,6,3,2] => 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [4,2,6,1,3,5] => 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [3,5,6,2,1,4] => 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [7,1,4,5,6,2,3] => [2,1,7,3,4,6,5] => ? = 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [1,3,4,2,6,5] => 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [1,2,5,3,6,4] => 0
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,1,4,5,6,2] => 0
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [2,5,4,6,1,3] => 0
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [2,4,1,6,5,3] => 0
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [2,1,3,6,5,4] => 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [2,4,6,1,3,5] => 0
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [7,5,4,1,2,3,6] => [1,2,6,5,3,7,4] => 0
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [1,4,2,3,6,5] => 0
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,2,1,5,6,3] => 0
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [2,1,5,3,6,4] => 0
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [2,4,5,6,1,3] => 0
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [4,5,2,6,1,3] => 1
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [2,3,1,6,5,4] => 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [7,1,6,5,2,3,4] => [3,1,2,7,6,5,4] => ? = 1
[5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [7,3,5,1,2,4,6] => [1,2,4,6,3,7,5] => 0
[5,2,1,1]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [7,4,1,5,2,3,6] => [4,1,6,2,3,7,5] => ? = 0
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [1,3,2,4,6,5] => 0
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,1,4,2,6,5] => 0
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [2,4,1,5,6,3] => 0
[4,2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [7,1,4,6,2,3,5] => [2,1,3,5,7,6,4] => ? = 0
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [2,3,5,6,1,4] => 0
[5,4,1]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [7,3,4,1,2,5,6] => [1,5,2,3,4,7,6] => ? = 0
[5,2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [7,1,4,5,2,3,6] => [2,1,6,3,4,7,5] => ? = 0
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [1,2,3,4,6,5] => 0
[5,3,2,1]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [5,7,1,2,3,4,6] => [1,2,3,4,6,7,5] => 0
[4,3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [6,1,7,2,3,4,5] => [3,1,2,4,7,5,6] => ? = 0
[5,4,2,1]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [7,4,1,2,3,5,6] => [1,2,5,3,4,7,6] => 0
[5,3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [7,1,5,2,3,4,6] => [2,1,3,6,4,7,5] => ? = 0
[4,3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [7,1,2,6,3,4,5] => [2,3,1,4,7,6,5] => ? = 0
[5,4,3,1]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [7,3,1,2,4,5,6] => [1,4,2,3,5,7,6] => 0
[5,4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [7,1,4,2,3,5,6] => [2,1,5,3,4,7,6] => ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,1,2,5,3,4,6] => [2,3,1,6,4,7,5] => ? = 0
[5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,1,2,3,4,5,6] => [1,2,3,4,5,7,6] => 0
[]
=> []
=> [1] => [1] => 0
Description
The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$.
Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$.
See also [[St000213]] and [[St000119]].
Matching statistic: St000629
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000629: Binary words ⟶ ℤResult quality: 50% ●values known / values provided: 50%●distinct values known / distinct values provided: 100%
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000629: Binary words ⟶ ℤResult quality: 50% ●values known / values provided: 50%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 1010 => 0000 => 0
[2]
=> [1,1,0,0,1,0]
=> 110010 => 000101 => 0
[1,1]
=> [1,0,1,1,0,0]
=> 101100 => 010100 => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => 00011011 => 0
[2,1]
=> [1,0,1,0,1,0]
=> 101010 => 000000 => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 01101100 => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => 0001110111 => 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 11010010 => 00010001 => 0
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 11001100 => 01010101 => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 01000100 => 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1011110000 => 0111011100 => ? = 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => 0001100011 => 0
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 11001010 => 00000101 => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 10110010 => 00010100 => 0
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 01010000 => 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1011101000 => 0110001100 => ? = 0
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 111101000010 => 000111000111 => 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => 0001001011 => 0
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => 0001101001 => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1110001100 => 0101011011 => ? = 0
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 10101010 => 00000000 => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => 0100101100 => ? = 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1100111000 => 0110110101 => ? = 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> 1011011000 => 0110100100 => ? = 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => 011100011100 => 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => 0000011011 => 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => 0001000001 => 0
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => 0001101100 => 0
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1101001100 => 0101010001 => ? = 0
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1100110100 => 0100010101 => ? = 0
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => 0100000100 => 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1010111000 => 0110110000 => ? = 0
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 111010100010 => 000110000011 => ? = 0
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => 0000010001 => 0
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => 0001010101 => 0
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => 0001000100 => 0
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1100101100 => 0101000101 => ? = 0
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => 0101010100 => ? = 1
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => 0100010000 => ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 101110101000 => 011000001100 => ? = 1
[5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 111010010010 => 000100100011 => ? = 0
[5,2,1,1]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 110110100010 => 000110001001 => ? = 0
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => 0000000101 => 0
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => 0000010100 => 0
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => 0001010000 => 0
[4,2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 101110100100 => 010010001100 => ? = 0
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => 0101000000 => ? = 0
[5,4,1]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 111010001010 => 000001100011 => ? = 0
[5,2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 101110100010 => 000110001100 => ? = 0
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => 0000000000 => 0
[5,3,2,1]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 110101010010 => 000100000001 => ? = 0
[4,3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 101101010100 => 010000000100 => ? = 0
[5,4,2,1]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 110101001010 => 000001000001 => ? = 0
[5,3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => 000100000100 => ? = 0
[4,3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => 010000010000 => ? = 0
[5,4,3,1]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 110100101010 => 000000010001 => ? = 0
[5,4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 101101001010 => 000001000100 => ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 101011010010 => 000100010000 => ? = 0
[5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 101010101010 => 000000000000 => ? = 0
[]
=> []
=> => => ? = 0
Description
The defect of a binary word.
The defect of a finite word $w$ is given by the difference between the maximum possible number and the actual number of palindromic factors contained in $w$. The maximum possible number of palindromic factors in a word $w$ is $|w|+1$.
Matching statistic: St000405
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000405: Permutations ⟶ ℤResult quality: 47% ●values known / values provided: 47%●distinct values known / distinct values provided: 100%
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000405: Permutations ⟶ ℤResult quality: 47% ●values known / values provided: 47%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [2,1] => 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,3,1] => 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [3,1,2] => 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => 0
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [3,1,4,5,6,7,2] => ? = 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [7,1,4,5,6,2,3] => ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [7,1,6,5,2,3,4] => ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [6,1,7,2,3,4,5] => ? = 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,7,5,6,2,4] => ? = 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,1,0,0,0,0]
=> [8,1,7,5,6,2,3,4] => ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => 0
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [3,1,7,6,2,4,5] => ? = 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> [3,1,8,5,6,7,2,4] => ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [7,1,4,6,2,3,5] => ? = 0
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [5,1,2,3,6,7,4] => 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,1,0,1,0,0,0]
=> [3,1,8,7,6,2,4,5] => ? = 0
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [7,3,5,1,2,4,6] => ? = 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [3,1,4,7,6,2,5] => ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,7,8,2,4,5,6] => ? = 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,1,0,0,0]
=> [8,1,4,7,6,2,3,5] => ? = 0
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> [3,1,9,8,6,7,2,4,5] => ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,1,2,6,3,7,5] => ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [7,1,4,8,2,3,5,6] => ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,1,0,0,0]
=> [3,1,4,8,6,7,2,5] => ? = 0
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [3,1,8,9,7,2,4,5,6] => ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [5,3,4,1,7,2,6] => ? = 0
[5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [7,1,8,5,2,3,4,6] => ? = 0
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,1,0,1,0,1,0,0,0,0]
=> [3,1,9,10,8,7,2,4,5,6] => ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [8,1,4,5,2,7,3,6] => ? = 0
[5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [9,1,4,5,7,2,8,3,6] => ? = 0
[4,3,2,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [9,1,4,5,2,8,3,6,7] => ? = 0
[5,4,2,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [9,1,6,5,2,3,8,4,7] => ? = 0
[5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,1,0,1,0,0,0]
=> [9,1,4,5,10,2,8,3,6,7] => ? = 0
[4,3,2,2,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [9,1,6,5,2,8,3,4,7] => ? = 0
[5,4,3,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [6,1,4,5,2,9,8,3,7] => ? = 0
[5,4,2,1,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [10,1,6,5,2,3,9,4,7,8] => ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,1,0,0,0,1,0,0,0]
=> [9,1,10,5,6,2,8,3,4,7] => ? = 0
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [10,1,4,6,2,7,9,3,5,8] => ? = 0
[]
=> []
=> []
=> [1] => 0
Description
The number of occurrences of the pattern 1324 in a permutation.
There is no explicit formula known for the number of permutations avoiding this pattern (denoted by $S_n(1324)$), but it is shown in [1], improving bounds in [2] and [3] that
$$\lim_{n \rightarrow \infty} \sqrt[n]{S_n(1324)} \leq 13.73718.$$
Matching statistic: St000406
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00088: Permutations —Kreweras complement⟶ Permutations
St000406: Permutations ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00088: Permutations —Kreweras complement⟶ Permutations
St000406: Permutations ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [2,1] => [1,2] => 0
[2]
=> [1,0,1,0]
=> [3,1,2] => [3,1,2] => 0
[1,1]
=> [1,1,0,0]
=> [2,3,1] => [1,2,3] => 0
[3]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => [3,4,1,2] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => [3,1,2,4] => 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => [4,1,3,2] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [3,4,5,1,2] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [3,4,1,2,5] => 0
[2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [3,5,1,4,2] => 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [4,5,1,3,2] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [3,4,5,1,2,6] => 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,1,2,4,5] => 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [3,4,6,1,5,2] => 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [5,2,1,4,3] => 0
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [3,5,6,1,4,2] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [6,1,2,3,4,7,5] => [3,4,5,6,1,2,7] => ? = 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [3,4,1,2,5,6] => 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [7,1,2,3,6,4,5] => [3,4,5,7,1,6,2] => ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [5,1,3,4,2] => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [3,6,2,1,5,4] => 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [7,1,2,6,3,4,5] => [3,4,6,7,1,5,2] => ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [5,2,6,1,4,3] => 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [6,1,7,2,3,4,5] => [3,5,6,7,1,2,4] => ? = 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [3,6,1,4,5,2] => 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [4,1,2,7,6,3,5] => [3,4,7,2,1,6,5] => ? = 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [8,1,2,3,7,4,5,6] => [3,4,5,7,8,1,6,2] => ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [5,6,3,1,4,2] => 0
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [3,1,2,4,5,6] => 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [3,1,7,6,2,4,5] => [3,6,2,7,1,5,4] => ? = 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [6,2,3,1,5,4] => 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [5,1,2,3,8,7,4,6] => [3,4,5,8,2,1,7,6] => ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [7,1,4,6,2,3,5] => [3,6,7,4,1,5,2] => ? = 0
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [4,1,2,5,6,7,3] => [3,4,1,2,5,6,7] => ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [4,1,2,8,7,3,5,6] => [3,4,7,2,8,1,6,5] => ? = 0
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [5,1,3,4,2,6] => 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [6,3,7,1,2,4,5] => [5,6,3,7,1,2,4] => ? = 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [3,1,4,7,6,2,5] => [3,7,2,4,1,6,5] => ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,7,8,2,4,5,6] => [3,6,2,7,8,1,4,5] => ? = 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [8,1,2,5,7,3,4,6] => [3,4,7,8,5,1,6,2] => ? = 0
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [5,1,2,3,9,8,4,6,7] => [3,4,5,8,2,9,1,7,6] => ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [6,1,4,5,2,7,3] => [3,6,1,4,5,2,7] => ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [7,1,4,8,2,3,5,6] => [3,6,7,4,8,1,2,5] => ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,5,8,7,3,6] => [3,4,8,2,5,1,7,6] => ? = 0
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [4,1,2,8,9,3,5,6,7] => [3,4,7,2,8,9,1,5,6] => ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [7,3,4,1,6,2,5] => [5,7,3,4,1,6,2] => ? = 0
[5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [7,1,8,5,2,3,4,6] => [3,6,7,8,5,1,2,4] => ? = 0
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [5,1,2,3,9,10,4,6,7,8] => [3,4,5,8,2,9,10,1,6,7] => ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [8,1,4,5,2,7,3,6] => [3,6,8,4,5,1,7,2] => ? = 0
[5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [9,1,2,5,6,3,8,4,7] => [3,4,7,9,5,6,1,8,2] => ? = 0
[4,3,2,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [9,1,4,5,2,8,3,6,7] => [3,6,8,4,5,9,1,7,2] => ? = 0
[5,4,2,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [9,1,6,5,2,3,8,4,7] => [3,6,7,9,5,4,1,8,2] => ? = 0
[5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [10,1,2,5,6,3,9,4,7,8] => [3,4,7,9,5,6,10,1,8,2] => ? = 0
[4,3,2,2,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [9,1,6,5,2,8,3,4,7] => [3,6,8,9,5,4,1,7,2] => ? = 0
[5,4,3,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [6,1,4,5,2,9,8,3,7] => [3,6,9,4,5,2,1,8,7] => ? = 0
[5,4,2,1,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [10,1,6,5,2,3,9,4,7,8] => [3,6,7,9,5,4,10,1,8,2] => ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [10,1,2,7,6,3,9,4,5,8] => [3,4,7,9,10,6,5,1,8,2] => ? = 0
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [10,1,4,6,2,7,9,3,5,8] => [3,6,9,4,10,5,7,1,8,2] => ? = 0
[]
=> []
=> [1] => [1] => 0
Description
The number of occurrences of the pattern 3241 in a permutation.
Matching statistic: St000666
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000666: Permutations ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000666: Permutations ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [2,1] => 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,3,1] => 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [3,1,2] => 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => 0
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [2,3,4,5,7,1,6] => ? = 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [2,3,4,7,1,5,6] => ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [2,3,7,1,4,5,6] => ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,7,1,3,4,5,6] => ? = 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [2,3,7,5,1,4,6] => ? = 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [2,3,4,8,1,5,6,7] => ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => 0
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [2,7,4,1,3,5,6] => ? = 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [2,3,4,8,6,1,5,7] => ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [2,7,4,5,1,3,6] => ? = 0
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [2,3,7,6,1,4,5] => ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [2,3,8,5,1,4,6,7] => ? = 0
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [7,3,4,1,2,5,6] => ? = 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [2,7,5,1,3,4,6] => ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0]
=> [2,8,4,1,3,5,6,7] => ? = 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0,1,0]
=> [2,3,8,5,6,1,4,7] => ? = 0
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,0]
=> [2,3,4,9,6,1,5,7,8] => ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [2,7,4,6,1,3,5] => ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [2,8,4,5,1,3,6,7] => ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [2,3,8,6,1,4,5,7] => ? = 0
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0,1,0]
=> [2,3,9,5,1,4,6,7,8] => ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [7,3,5,1,2,4,6] => ? = 0
[5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> [2,8,4,5,6,1,3,7] => ? = 0
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,0,1,0]
=> [2,3,4,10,6,1,5,7,8,9] => ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [2,8,4,6,1,3,5,7] => ? = 0
[5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,1,0,0,1,0]
=> [2,3,9,5,7,1,4,6,8] => ? = 0
[4,3,2,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,0]
=> [2,9,4,6,1,3,5,7,8] => ? = 0
[5,4,2,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0,1,0]
=> [2,9,4,5,7,1,3,6,8] => ? = 0
[5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,1,0,0,1,0,1,0]
=> [2,3,10,5,7,1,4,6,8,9] => ? = 0
[4,3,2,2,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,1,0,0,1,0]
=> [2,7,4,9,1,3,5,6,8] => ? = 0
[5,4,3,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0,1,0]
=> [2,9,4,7,6,1,3,5,8] => ? = 0
[5,4,2,1,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0,1,0,1,0]
=> [2,10,4,5,7,1,3,6,8,9] => ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,1,0,1,0,0,1,0]
=> [2,3,8,5,10,1,4,6,7,9] => ? = 0
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,0,1,0]
=> [2,8,4,10,6,1,3,5,7,9] => ? = 0
[]
=> []
=> []
=> [1] => 0
Description
The number of right tethers of a permutation.
Let $\pi$ be a permutation of length $n$. A raft of $\pi$ is a non-empty maximal sequence of consecutive small ascents, [[St000441]], and a right tether is a large ascent between two consecutive rafts of $\pi$.
See Definition 3.10 and Example 3.11 in [1].
Matching statistic: St001140
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001140: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001140: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,1,0,0]
=> 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 0
[4]
=> [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]
=> 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[2,1,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]
=> 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 0
[4,1]
=> [1,0,1,0,1,0,1,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]
=> 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 0
[2,1,1,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]
=> 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? = 0
[4,2]
=> [1,0,1,0,1,1,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]
=> 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,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]
=> 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> ? = 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,0]
=> ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 0
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> ? = 0
[2,2,2,1]
=> [1,1,1,1,0,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]
=> 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,1,0,0,0,0,0]
=> ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> ? = 0
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0]
=> ? = 0
[3,3,2]
=> [1,1,1,0,1,1,0,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]
=> 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> ? = 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0]
=> ? = 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,1,0,1,0,0,0,0,0]
=> ? = 0
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0,0]
=> ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,0,0]
=> ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,1,0,0,0,0]
=> ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,1,0,0,0,0]
=> ? = 0
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0,0]
=> ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> ? = 0
[5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,1,0,0,0,0,0]
=> ? = 0
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0,0,0]
=> ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,1,0,0,0,0]
=> ? = 0
[5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,1,0,1,1,0,0,0,0,0]
=> ? = 0
[4,3,2,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,1,1,0,0,0,0]
=> ? = 0
[5,4,2,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,1,1,0,0,0,0,0]
=> ? = 0
[5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,1,1,0,0,0,0]
=> ?
=> ? = 0
[4,3,2,2,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,0]
=> ? = 0
[5,4,3,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,1,0,0,1,0,0,1,1,0,0,0,0]
=> ? = 0
[5,4,2,1,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> ?
=> ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,0]
=> ?
=> ? = 0
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,1,1,0,1,0,0,0]
=> ?
=> ? = 0
[]
=> []
=> []
=> [1,0]
=> 0
Description
Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001181
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
St001181: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
St001181: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0
[2]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0
[1,1]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[4]
=> [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]
=> 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[2,1,1]
=> [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
[1,1,1,1]
=> [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
[4,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,0,1,0,1,0,1,1,0,0,0]
=> 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 0
[3,1,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,0,1,0,1,1,0,0,0]
=> 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
[2,1,1,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,0,1,1,0,1,1,0,0,0]
=> 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 0
[4,2]
=> [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,1,1,0,0,0,0]
=> 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,1,0,0,0]
=> ? = 1
[2,2,2]
=> [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
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> ? = 0
[4,3]
=> [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]
=> 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0,1,0]
=> ? = 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 0
[3,3,1]
=> [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,1,1,1,0,0,0,0,1,0]
=> 0
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0,1,0]
=> ? = 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0,1,0]
=> ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0,1,0]
=> ? = 0
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,1,1,0,0,0,0,0]
=> ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0,1,0,1,0]
=> ? = 0
[3,3,2]
=> [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,1,1,1,0,0,0,0,0]
=> 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,0]
=> ? = 0
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0,1,0,1,0]
=> ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0,1,0,1,0]
=> ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0
[5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,0,1,0]
=> ? = 0
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0
[5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0
[4,3,2,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,1,0,1,0,0]
=> ? = 0
[5,4,2,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0
[5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,0,1,0,0]
=> ? = 0
[4,3,2,2,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0
[5,4,3,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0,0]
=> [1,1,1,0,1,1,1,0,1,1,0,0,0,0,1,0,0,0]
=> ? = 0
[5,4,2,1,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,1,1,0,0,0,0,1,0,1,0,0]
=> ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0,0]
=> [1,1,1,0,1,1,1,0,1,1,0,0,0,0,1,0,0,0,1,0]
=> ? = 0
[]
=> []
=> [1,0]
=> [1,0]
=> 0
Description
Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra.
Matching statistic: St001193
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001193: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001193: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,1,0,0]
=> 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[4]
=> [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]
=> 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 0
[4,1]
=> [1,0,1,0,1,0,1,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]
=> 0
[3,2]
=> [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]
=> 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 0
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? = 0
[4,2]
=> [1,0,1,0,1,1,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]
=> 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> ? = 1
[2,2,2]
=> [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]
=> 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,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
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> ? = 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> ? = 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0]
=> ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 0
[3,2,2]
=> [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]
=> 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> ? = 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,1,0,0,0]
=> ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> ? = 0
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,0,1,0,0,0,0]
=> ? = 0
[3,3,2]
=> [1,1,1,0,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]
=> 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> ? = 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,1,0,1,0,0,0,0]
=> ? = 0
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,1,0,1,0,0,0,0]
=> ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,1,0,0,0,0,0]
=> ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,1,0,0,0]
=> ? = 0
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,1,0,0,0]
=> ? = 0
[5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,1,0,1,0,0,0,0,0]
=> ? = 0
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,1,0,0,0]
=> ? = 0
[5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,1,0,0,1,0,0,0]
=> ? = 0
[4,3,2,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,1,0,0,1,0,0,0,0]
=> ? = 0
[5,4,2,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,1,1,0,0,0,1,0,0,0]
=> ? = 0
[5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,1,1,0,0,1,0,0,0,0]
=> ? = 0
[4,3,2,2,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,1,0,0,1,0,0,0,0]
=> ? = 0
[5,4,3,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,1,1,0,1,0,0,0]
=> ? = 0
[5,4,2,1,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,1,1,0,0,0,1,0,0,0,0]
=> ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,1,1,0,0,1,0,0,0,0]
=> ? = 0
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,1,1,0,1,0,0,0,0]
=> ? = 0
[]
=> []
=> []
=> [1,0]
=> 0
Description
The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module.
Matching statistic: St001292
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001292: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001292: Dyck paths ⟶ ℤResult quality: 45% ●values known / values provided: 45%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,1,0,0]
=> 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 0
[4]
=> [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]
=> 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[2,1,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]
=> 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 0
[4,1]
=> [1,0,1,0,1,0,1,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]
=> 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 0
[2,1,1,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]
=> 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? = 0
[4,2]
=> [1,0,1,0,1,1,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]
=> 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,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]
=> 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> ? = 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,0]
=> ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 0
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> ? = 0
[2,2,2,1]
=> [1,1,1,1,0,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]
=> 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,1,0,0,0,0,0]
=> ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> ? = 0
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0]
=> ? = 0
[3,3,2]
=> [1,1,1,0,1,1,0,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]
=> 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> ? = 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> ? = 0
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0]
=> ? = 1
[5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,1,0,1,0,0,0,0,0]
=> ? = 0
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0,0]
=> ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,0,0]
=> ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,1,0,0,0,0]
=> ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,1,0,0,0,0]
=> ? = 0
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0,0]
=> ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> ? = 0
[5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,1,0,0,0,0,0]
=> ? = 0
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,0,0,0]
=> ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,1,0,0,0,0]
=> ? = 0
[5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,1,0,1,1,0,0,0,0,0]
=> ? = 0
[4,3,2,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,1,1,0,0,0,0]
=> ? = 0
[5,4,2,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,1,1,0,0,0,0,0]
=> ? = 0
[5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,1,1,0,0,0,0]
=> ?
=> ? = 0
[4,3,2,2,1]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,0]
=> ? = 0
[5,4,3,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,1,0,0,1,0,0,1,1,0,0,0,0]
=> ? = 0
[5,4,2,1,1]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> ?
=> ? = 0
[5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,0]
=> ?
=> ? = 0
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,1,1,0,1,0,0,0]
=> ?
=> ? = 0
[]
=> []
=> []
=> [1,0]
=> 0
Description
The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path.
Here $A$ is the Nakayama algebra associated to a Dyck path as given in [[DyckPaths/NakayamaAlgebras]].
The following 252 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001550The number of inversions between exceedances where the greater exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St000803The number of occurrences of the vincular pattern |132 in a permutation. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000908The length of the shortest maximal antichain in a poset. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001344The neighbouring number of a permutation. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001722The number of minimal chains with small intervals between a binary word and the top element. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000914The sum of the values of the Möbius function of a poset. St001890The maximum magnitude of the Möbius function of a poset. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000623The number of occurrences of the pattern 52341 in a permutation. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001381The fertility of a permutation. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001549The number of restricted non-inversions between exceedances. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St000056The decomposition (or block) number of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St000694The number of affine bounded permutations that project to a given permutation. St001256Number of simple reflexive modules that are 2-stable reflexive. St001461The number of topologically connected components of the chord diagram of a permutation. St001490The number of connected components of a skew partition. St001590The crossing number of a perfect matching. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001811The Castelnuovo-Mumford regularity of a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001866The nesting alignments of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St001434The number of negative sum pairs of a signed permutation. St000022The number of fixed points of a permutation. St000842The breadth of a permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001487The number of inner corners of a skew partition. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000297The number of leading ones in a binary word. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000310The minimal degree of a vertex of a graph. St000407The number of occurrences of the pattern 2143 in a permutation. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000650The number of 3-rises of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000787The number of flips required to make a perfect matching noncrossing. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001429The number of negative entries in a signed permutation. St001577The minimal number of edges to add or remove to make a graph a cograph. St001856The number of edges in the reduced word graph of a permutation. St000286The number of connected components of the complement of a graph. St000570The Edelman-Greene number of a permutation. St000657The smallest part of an integer composition. St000788The number of nesting-similar perfect matchings of a perfect matching. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001162The minimum jump of a permutation. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001260The permanent of an alternating sign matrix. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001481The minimal height of a peak of a Dyck path. St001518The number of graphs with the same ordinary spectrum as the given graph. St000877The depth of the binary word interpreted as a path. St000878The number of ones minus the number of zeros of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001371The length of the longest Yamanouchi prefix of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000807The sum of the heights of the valleys of the associated bargraph. St000894The trace of an alternating sign matrix. St000943The number of spots the most unlucky car had to go further in a parking function. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001520The number of strict 3-descents. St001524The degree of symmetry of a binary word. St001556The number of inversions of the third entry of a permutation. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001845The number of join irreducibles minus the rank of a lattice. St001867The number of alignments of type EN of a signed permutation. St000295The length of the border of a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000763The sum of the positions of the strong records of an integer composition. St000805The number of peaks of the associated bargraph. St001267The length of the Lyndon factorization of the binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001437The flex of a binary word. St001613The binary logarithm of the size of the center of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001881The number of factors of a lattice as a Cartesian product of lattices. St001884The number of borders of a binary word. St000876The number of factors in the Catalan decomposition of a binary word. 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$. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St000627The exponent of a binary word. St000900The minimal number of repetitions of a part in an integer composition. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000296The length of the symmetric border of a binary word. St000902 The minimal number of repetitions of an integer composition. St001413Half the length of the longest even length palindromic prefix of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001889The size of the connectivity set of a signed permutation. 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$. St001621The number of atoms of a lattice. St000417The size of the automorphism group of the ordered tree. St001058The breadth of the ordered tree. St000068The number of minimal elements in a poset. St000455The second largest eigenvalue of a graph if it is integral. 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$. St001410The minimal entry of a semistandard tableau. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000264The girth of a graph, which is not a tree. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000534The number of 2-rises of a permutation. St000546The number of global descents of a permutation. St000731The number of double exceedences of a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000451The length of the longest pattern of the form k 1 2. St001624The breadth of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000039The number of crossings of a permutation. St000091The descent variation of a composition. St000234The number of global ascents of a permutation. St000247The number of singleton blocks of a set partition. St000317The cycle descent number of a permutation. St000355The number of occurrences of the pattern 21-3. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000367The number of simsun double descents of a permutation. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 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. St000462The major index minus the number of excedences of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000496The rcs statistic of a set partition. St000516The number of stretching pairs of a permutation. St000557The number of occurrences of the pattern {{1},{2},{3}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000562The number of internal points of a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000584The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal, 3 is maximal. St000587The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000664The number of right ropes 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. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000962The 3-shifted major index of a permutation. St000989The number of final rises of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001130The number of two successive successions in a permutation. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001537The number of cyclic crossings of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. 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. St001781The interlacing number of a set partition. St001847The number of occurrences of the pattern 1432 in a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000021The number of descents of a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000154The sum of the descent bottoms of a permutation. St000210Minimum over maximum difference of elements in cycles. St000253The crossing number of a set partition. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000654The first descent of a permutation. St000729The minimal arc length of a set partition. St000864The number of circled entries of the shifted recording tableau of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001665The number of pure excedances of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001806The upper middle entry of a permutation. St001928The number of non-overlapping descents in a permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000823The number of unsplittable factors of the set partition. St000862The number of parts of the shifted shape of a permutation. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau.
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!