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: St001800
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00169: Signed permutations —odd cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001800: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001800: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => []
=> []
=> 1
[-1] => [1]
=> [1,0,1,0]
=> 2
[1,2] => []
=> []
=> 1
[1,-2] => [1]
=> [1,0,1,0]
=> 2
[-1,2] => [1]
=> [1,0,1,0]
=> 2
[-1,-2] => [1,1]
=> [1,0,1,1,0,0]
=> 3
[2,1] => []
=> []
=> 1
[2,-1] => [2]
=> [1,1,0,0,1,0]
=> 3
[-2,1] => [2]
=> [1,1,0,0,1,0]
=> 3
[-2,-1] => []
=> []
=> 1
[1,2,3] => []
=> []
=> 1
[1,2,-3] => [1]
=> [1,0,1,0]
=> 2
[1,-2,3] => [1]
=> [1,0,1,0]
=> 2
[1,-2,-3] => [1,1]
=> [1,0,1,1,0,0]
=> 3
[-1,2,3] => [1]
=> [1,0,1,0]
=> 2
[-1,2,-3] => [1,1]
=> [1,0,1,1,0,0]
=> 3
[-1,-2,3] => [1,1]
=> [1,0,1,1,0,0]
=> 3
[-1,-2,-3] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 4
[1,3,2] => []
=> []
=> 1
[1,3,-2] => [2]
=> [1,1,0,0,1,0]
=> 3
[1,-3,2] => [2]
=> [1,1,0,0,1,0]
=> 3
[1,-3,-2] => []
=> []
=> 1
[-1,3,2] => [1]
=> [1,0,1,0]
=> 2
[-1,3,-2] => [2,1]
=> [1,0,1,0,1,0]
=> 4
[-1,-3,2] => [2,1]
=> [1,0,1,0,1,0]
=> 4
[-1,-3,-2] => [1]
=> [1,0,1,0]
=> 2
[2,1,3] => []
=> []
=> 1
[2,1,-3] => [1]
=> [1,0,1,0]
=> 2
[2,-1,3] => [2]
=> [1,1,0,0,1,0]
=> 3
[2,-1,-3] => [2,1]
=> [1,0,1,0,1,0]
=> 4
[-2,1,3] => [2]
=> [1,1,0,0,1,0]
=> 3
[-2,1,-3] => [2,1]
=> [1,0,1,0,1,0]
=> 4
[-2,-1,3] => []
=> []
=> 1
[-2,-1,-3] => [1]
=> [1,0,1,0]
=> 2
[2,3,1] => []
=> []
=> 1
[2,3,-1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
[2,-3,1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
[2,-3,-1] => []
=> []
=> 1
[-2,3,1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
[-2,3,-1] => []
=> []
=> 1
[-2,-3,1] => []
=> []
=> 1
[-2,-3,-1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
[3,1,2] => []
=> []
=> 1
[3,1,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
[3,-1,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
[3,-1,-2] => []
=> []
=> 1
[-3,1,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
[-3,1,-2] => []
=> []
=> 1
[-3,-1,2] => []
=> []
=> 1
[-3,-1,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 4
Description
The number of 3-Catalan paths having this Dyck path as first and last coordinate projections.
A 3-Catalan path is a lattice path from $(0,0,0)$ to $(n,n,n)$ consisting of steps $(1,0,0)$, $(0,1,0)$, and $(0,0,1)$ such that for each point $(x,y,z)$ on the path we have $x \geq y \geq z$.
Its first and last coordinate projections, denoted by $D_{xy}$ and $D_{yz}$, are the Dyck paths obtained by projecting the Catalan path onto the $x,y$-plane and the $y,z$-plane, respectively.
For a given Dyck path $D$ this is the number of Catalan paths $C$ such that $D_{xy}(C) = D_{yz}(C) = D$.
If $D$ is of semilength $n$, $r_i(D)$ denotes the number of downsteps between the $i$-th and $(i+1)$-st upstep, and $s_i(D)$ denotes the number of upsteps between the $i$-th and $(i+1)$-st downstep, then this number is given by $\prod\limits_{i=1}^{n-1} \binom{r_i(D) + s_i(D)}{r_i(D)}$.
Matching statistic: St001582
Mp00169: Signed permutations —odd cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001582: Permutations ⟶ ℤResult quality: 25% ●values known / values provided: 30%●distinct values known / distinct values provided: 25%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001582: Permutations ⟶ ℤResult quality: 25% ●values known / values provided: 30%●distinct values known / distinct values provided: 25%
Values
[1] => []
=> []
=> [1] => ? = 1 - 1
[-1] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,2] => []
=> []
=> [1] => ? = 1 - 1
[1,-2] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,2] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,-2] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[2,1] => []
=> []
=> [1] => ? = 1 - 1
[2,-1] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[-2,1] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[-2,-1] => []
=> []
=> [1] => ? = 1 - 1
[1,2,3] => []
=> []
=> [1] => ? = 1 - 1
[1,2,-3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,-2,3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,-2,-3] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[-1,2,3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,2,-3] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[-1,-2,3] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[-1,-2,-3] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 4 - 1
[1,3,2] => []
=> []
=> [1] => ? = 1 - 1
[1,3,-2] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[1,-3,2] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[1,-3,-2] => []
=> []
=> [1] => ? = 1 - 1
[-1,3,2] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,3,-2] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-1,-3,2] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-1,-3,-2] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[2,1,3] => []
=> []
=> [1] => ? = 1 - 1
[2,1,-3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[2,-1,3] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[2,-1,-3] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-2,1,3] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[-2,1,-3] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-2,-1,3] => []
=> []
=> [1] => ? = 1 - 1
[-2,-1,-3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[2,3,1] => []
=> []
=> [1] => ? = 1 - 1
[2,3,-1] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[2,-3,1] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[2,-3,-1] => []
=> []
=> [1] => ? = 1 - 1
[-2,3,1] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[-2,3,-1] => []
=> []
=> [1] => ? = 1 - 1
[-2,-3,1] => []
=> []
=> [1] => ? = 1 - 1
[-2,-3,-1] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[3,1,2] => []
=> []
=> [1] => ? = 1 - 1
[3,1,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[3,-1,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[3,-1,-2] => []
=> []
=> [1] => ? = 1 - 1
[-3,1,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[-3,1,-2] => []
=> []
=> [1] => ? = 1 - 1
[-3,-1,2] => []
=> []
=> [1] => ? = 1 - 1
[-3,-1,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[3,2,1] => []
=> []
=> [1] => ? = 1 - 1
[3,2,-1] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[3,-2,1] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[3,-2,-1] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-3,2,1] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[-3,2,-1] => []
=> []
=> [1] => ? = 1 - 1
[-3,-2,1] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-3,-2,-1] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,2,3,4] => []
=> []
=> [1] => ? = 1 - 1
[1,2,3,-4] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,2,-3,4] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,2,-3,-4] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[1,-2,3,4] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,-2,3,-4] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[1,-2,-3,4] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[1,-2,-3,-4] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 4 - 1
[-1,2,3,4] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,2,3,-4] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[-1,2,-3,4] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[-1,2,-3,-4] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 4 - 1
[-1,-2,3,4] => [1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 2 = 3 - 1
[-1,-2,3,-4] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 4 - 1
[-1,-2,-3,4] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 4 - 1
[-1,-2,-3,-4] => [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => ? = 5 - 1
[1,2,4,3] => []
=> []
=> [1] => ? = 1 - 1
[1,2,4,-3] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[1,2,-4,3] => [2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 2 = 3 - 1
[1,2,-4,-3] => []
=> []
=> [1] => ? = 1 - 1
[1,-2,4,3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,-2,4,-3] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[1,-2,-4,3] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[1,-2,-4,-3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,2,4,3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,2,4,-3] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-1,2,-4,3] => [2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 3 = 4 - 1
[-1,2,-4,-3] => [1]
=> [1,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[-1,-2,4,-3] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 3 - 1
[-1,-2,-4,3] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 3 - 1
[1,3,2,4] => []
=> []
=> [1] => ? = 1 - 1
[1,-3,-2,4] => []
=> []
=> [1] => ? = 1 - 1
[-1,3,-2,-4] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 3 - 1
[-1,-3,2,-4] => [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 3 - 1
[1,3,4,2] => []
=> []
=> [1] => ? = 1 - 1
[1,3,4,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[1,3,-4,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[1,3,-4,-2] => []
=> []
=> [1] => ? = 1 - 1
[1,-3,4,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
[1,-3,4,-2] => []
=> []
=> [1] => ? = 1 - 1
[1,-3,-4,2] => []
=> []
=> [1] => ? = 1 - 1
[1,-3,-4,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => ? = 4 - 1
Description
The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order.
Matching statistic: St001491
Mp00169: Signed permutations —odd cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 8% ●values known / values provided: 13%●distinct values known / distinct values provided: 8%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 8% ●values known / values provided: 13%●distinct values known / distinct values provided: 8%
Values
[1] => []
=> []
=> => ? = 1 - 2
[-1] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,2] => []
=> []
=> => ? = 1 - 2
[1,-2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,-2] => [1,1]
=> [1,0,1,1,0,0]
=> 101100 => ? = 3 - 2
[2,1] => []
=> []
=> => ? = 1 - 2
[2,-1] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[-2,1] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[-2,-1] => []
=> []
=> => ? = 1 - 2
[1,2,3] => []
=> []
=> => ? = 1 - 2
[1,2,-3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,-2,3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,-2,-3] => [1,1]
=> [1,0,1,1,0,0]
=> 101100 => ? = 3 - 2
[-1,2,3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,2,-3] => [1,1]
=> [1,0,1,1,0,0]
=> 101100 => ? = 3 - 2
[-1,-2,3] => [1,1]
=> [1,0,1,1,0,0]
=> 101100 => ? = 3 - 2
[-1,-2,-3] => [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => ? = 4 - 2
[1,3,2] => []
=> []
=> => ? = 1 - 2
[1,3,-2] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[1,-3,2] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[1,-3,-2] => []
=> []
=> => ? = 1 - 2
[-1,3,2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,3,-2] => [2,1]
=> [1,0,1,0,1,0]
=> 101010 => ? = 4 - 2
[-1,-3,2] => [2,1]
=> [1,0,1,0,1,0]
=> 101010 => ? = 4 - 2
[-1,-3,-2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,1,3] => []
=> []
=> => ? = 1 - 2
[2,1,-3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,-1,3] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[2,-1,-3] => [2,1]
=> [1,0,1,0,1,0]
=> 101010 => ? = 4 - 2
[-2,1,3] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[-2,1,-3] => [2,1]
=> [1,0,1,0,1,0]
=> 101010 => ? = 4 - 2
[-2,-1,3] => []
=> []
=> => ? = 1 - 2
[-2,-1,-3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,3,1] => []
=> []
=> => ? = 1 - 2
[2,3,-1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[2,-3,1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[2,-3,-1] => []
=> []
=> => ? = 1 - 2
[-2,3,1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[-2,3,-1] => []
=> []
=> => ? = 1 - 2
[-2,-3,1] => []
=> []
=> => ? = 1 - 2
[-2,-3,-1] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[3,1,2] => []
=> []
=> => ? = 1 - 2
[3,1,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[3,-1,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[3,-1,-2] => []
=> []
=> => ? = 1 - 2
[-3,1,2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[-3,1,-2] => []
=> []
=> => ? = 1 - 2
[-3,-1,2] => []
=> []
=> => ? = 1 - 2
[-3,-1,-2] => [3]
=> [1,1,1,0,0,0,1,0]
=> 11100010 => ? = 4 - 2
[3,2,1] => []
=> []
=> => ? = 1 - 2
[3,2,-1] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[3,-2,1] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[3,-2,-1] => [2,1]
=> [1,0,1,0,1,0]
=> 101010 => ? = 4 - 2
[-3,2,1] => [2]
=> [1,1,0,0,1,0]
=> 110010 => ? = 3 - 2
[-3,2,-1] => []
=> []
=> => ? = 1 - 2
[-3,-2,1] => [2,1]
=> [1,0,1,0,1,0]
=> 101010 => ? = 4 - 2
[-3,-2,-1] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,2,3,4] => []
=> []
=> => ? = 1 - 2
[1,2,3,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,2,-3,4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,2,-3,-4] => [1,1]
=> [1,0,1,1,0,0]
=> 101100 => ? = 3 - 2
[1,-2,3,4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,-2,3,-4] => [1,1]
=> [1,0,1,1,0,0]
=> 101100 => ? = 3 - 2
[1,-2,-3,4] => [1,1]
=> [1,0,1,1,0,0]
=> 101100 => ? = 3 - 2
[-1,2,3,4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,-2,4,3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,-2,-4,-3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,2,4,3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,2,-4,-3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,3,2,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,-3,-2,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,3,2,4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,-3,-2,4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,3,4,2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,3,-4,-2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,-3,4,-2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,-3,-4,2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,4,2,3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,4,-2,-3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,-4,2,-3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,-4,-2,3] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,4,-3,2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[1,-4,-3,-2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,4,3,2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-1,-4,3,-2] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,1,3,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,1,-3,4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-2,-1,3,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-2,-1,-3,4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,3,1,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,-3,-1,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-2,3,-1,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-2,-3,1,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,4,-3,1] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[2,-4,-3,-1] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-2,4,-3,-1] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[-2,-4,-3,1] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[3,1,2,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
[3,-1,-2,-4] => [1]
=> [1,0,1,0]
=> 1010 => 0 = 2 - 2
Description
The number of indecomposable projective-injective modules in the algebra corresponding to a subset.
Let $A_n=K[x]/(x^n)$.
We associate to a nonempty subset S of an (n-1)-set the module $M_S$, which is the direct sum of $A_n$-modules with indecomposable non-projective direct summands of dimension $i$ when $i$ is in $S$ (note that such modules have vector space dimension at most n-1). Then the corresponding algebra associated to S is the stable endomorphism ring of $M_S$. We decode the subset as a binary word so that for example the subset $S=\{1,3 \} $ of $\{1,2,3 \}$ is decoded as 101.
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!