searching the database
Your data matches 3 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: St000335
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
St000335: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1
[1,0,1,0]
=> 1
[1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 3
Description
The difference of lower and upper interactions.
An ''upper interaction'' in a Dyck path is the occurrence of a factor $0^k 1^k$ with $k \geq 1$ (see [[St000331]]), and a ''lower interaction'' is the occurrence of a factor $1^k 0^k$ with $k \geq 1$. In both cases, $1$ denotes an up-step $0$ denotes a a down-step.
Matching statistic: St001431
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001431: Dyck paths ⟶ ℤResult quality: 11% ●values known / values provided: 11%●distinct values known / distinct values provided: 57%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001431: Dyck paths ⟶ ℤResult quality: 11% ●values known / values provided: 11%●distinct values known / distinct values provided: 57%
Values
[1,0]
=> [2,1] => [1,1,0,0]
=> 1
[1,0,1,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> 1
[1,1,0,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 2
[1,0,1,0,1,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0]
=> [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 2
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [1,1,1,1,0,0,0,1,1,0,0,0]
=> ? = 2
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [1,1,1,1,0,0,0,1,0,1,0,0]
=> ? = 3
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [1,1,1,0,0,1,1,1,0,0,0,0]
=> ? = 2
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,1,1,0,0,1,1,0,0,1,0,0]
=> ? = 2
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 2
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [1,1,1,0,0,1,0,1,1,0,0,0]
=> ? = 3
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [1,1,1,0,0,1,1,1,0,0,0,0]
=> ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [1,1,1,0,0,1,0,1,0,1,0,0]
=> ? = 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [1,1,0,1,1,1,0,0,0,1,0,0]
=> ? = 3
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,1,0,1,1,0,0,1,1,0,0,0]
=> ? = 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [1,1,0,1,1,0,0,1,0,1,0,0]
=> ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [1,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 2
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [1,1,1,1,0,0,0,1,1,0,0,0]
=> ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [1,1,1,1,0,0,0,1,0,1,0,0]
=> ? = 3
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [1,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 3
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [1,1,0,1,0,1,1,0,0,1,0,0]
=> ? = 3
[1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 2
[1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 2
[1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [1,1,0,1,1,1,0,0,0,1,0,0]
=> ? = 2
[1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 2
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [1,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 4
[1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [1,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 3
[1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 2
[1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 5
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,1,2,3,4,5,6] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [6,1,2,3,4,7,5] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? = 2
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,1,2,3,7,4,6] => [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> ? = 2
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [7,1,2,3,6,4,5] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [5,1,2,3,6,7,4] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> ? = 3
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [4,1,2,7,3,5,6] => [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> ? = 2
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,1,2,6,3,7,5] => [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> ? = 2
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,1,2,5,3,4,6] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 1
Description
Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path.
The modified algebra B is obtained from the stable Auslander algebra kQ/I by deleting all relations which contain walks of length at least three (conjectural this step of deletion is not necessary as the stable higher Auslander algebras might be quadratic) and taking as B then the algebra kQ^(op)/J when J is the quadratic perp of the ideal I.
See http://www.findstat.org/DyckPaths/NakayamaAlgebras for the definition of Loewy length and Nakayama algebras associated to Dyck paths.
Matching statistic: St001526
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001526: Dyck paths ⟶ ℤResult quality: 11% ●values known / values provided: 11%●distinct values known / distinct values provided: 57%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001526: Dyck paths ⟶ ℤResult quality: 11% ●values known / values provided: 11%●distinct values known / distinct values provided: 57%
Values
[1,0]
=> [2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 2 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 2 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> ? = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> ? = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> ? = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> ? = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> ? = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 3 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> ? = 3 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
[1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 2 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 2 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> ? = 4 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 2 + 1
[1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 5 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,1,2,3,4,5,6] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [6,1,2,3,4,7,5] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 2 + 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,1,2,3,7,4,6] => [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 2 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [7,1,2,3,6,4,5] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [5,1,2,3,6,7,4] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 3 + 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [4,1,2,7,3,5,6] => [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 2 + 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,1,2,6,3,7,5] => [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,1,1,0,0,0]
=> ? = 2 + 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,1,2,5,3,4,6] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 + 1
Description
The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path.
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!