Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000005
Mapping
Mp00169: Signed permutations —odd cycle type⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000005: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[-1] => [1]
 => [1,0]
 => [1,0]
 => 0
[1,-2] => [1]
 => [1,0]
 => [1,0]
 => 0
[-1,2] => [1]
 => [1,0]
 => [1,0]
 => 0
[-1,-2] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[2,-1] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[-2,1] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[1,2,-3] => [1]
 => [1,0]
 => [1,0]
 => 0
[1,-2,3] => [1]
 => [1,0]
 => [1,0]
 => 0
[1,-2,-3] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[-1,2,3] => [1]
 => [1,0]
 => [1,0]
 => 0
[-1,2,-3] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[-1,-2,3] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[-1,-2,-3] => [1,1,1]
 => [1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => 3
[1,3,-2] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[1,-3,2] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[-1,3,2] => [1]
 => [1,0]
 => [1,0]
 => 0
[-1,3,-2] => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[-1,-3,2] => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[-1,-3,-2] => [1]
 => [1,0]
 => [1,0]
 => 0
[2,1,-3] => [1]
 => [1,0]
 => [1,0]
 => 0
[2,-1,3] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[2,-1,-3] => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[-2,1,3] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[-2,1,-3] => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[-2,-1,-3] => [1]
 => [1,0]
 => [1,0]
 => 0
[2,3,-1] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[2,-3,1] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[-2,3,1] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[-2,-3,-1] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[3,1,-2] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[3,-1,2] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[-3,1,2] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[-3,-1,-2] => [3]
 => [1,0,1,0,1,0]
 => [1,1,0,1,0,0]
 => 1
[3,2,-1] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[3,-2,1] => [1]
 => [1,0]
 => [1,0]
 => 0
[3,-2,-1] => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[-3,2,1] => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[-3,-2,1] => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[-3,-2,-1] => [1]
 => [1,0]
 => [1,0]
 => 0
[1,2,3,-4] => [1]
 => [1,0]
 => [1,0]
 => 0
[1,2,-3,4] => [1]
 => [1,0]
 => [1,0]
 => 0
[1,2,-3,-4] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[1,-2,3,4] => [1]
 => [1,0]
 => [1,0]
 => 0
[1,-2,3,-4] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[1,-2,-3,4] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[1,-2,-3,-4] => [1,1,1]
 => [1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => 3
[-1,2,3,4] => [1]
 => [1,0]
 => [1,0]
 => 0
[-1,2,3,-4] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[-1,2,-3,4] => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[-1,2,-3,-4] => [1,1,1]
 => [1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => 3
Description
The bounce statistic of a Dyck path. The '''bounce path''' $D'$ of a Dyck path $D$ is the Dyck path obtained from $D$ by starting at the end point $(2n,0)$, traveling north-west until hitting $D$, then bouncing back south-west to the $x$-axis, and repeating this procedure until finally reaching the point $(0,0)$. The points where $D'$ touches the $x$-axis are called '''bounce points''', and a bounce path is uniquely determined by its bounce points. This statistic is given by the sum of all $i$ for which the bounce path $D'$ of $D$ touches the $x$-axis at $(2i,0)$. In particular, the bounce statistics of $D$ and $D'$ coincide.
Matching statistic: St001491
Mapping
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: 17%●distinct values known / distinct values provided: 8%
Values
[-1] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,-2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-2] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[2,-1] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[-2,1] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[1,2,-3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,-2,3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,-2,-3] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[-1,2,3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,2,-3] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[-1,-2,3] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[-1,-2,-3] => [1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 10111000 => ? = 3
[1,3,-2] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[1,-3,2] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[-1,3,2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,3,-2] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-1,-3,2] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-1,-3,-2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,1,-3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,-1,3] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[2,-1,-3] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-2,1,3] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[-2,1,-3] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-2,-1,-3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,3,-1] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[2,-3,1] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[-2,3,1] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[-2,-3,-1] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[3,1,-2] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[3,-1,2] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[-3,1,2] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[-3,-1,-2] => [3]
 => [1,1,1,0,0,0,1,0]
 => 11100010 => ? = 1
[3,2,-1] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[3,-2,1] => [1]
 => [1,0,1,0]
 => 1010 => 0
[3,-2,-1] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-3,2,1] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[-3,-2,1] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-3,-2,-1] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,2,3,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,2,-3,4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,2,-3,-4] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[1,-2,3,4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,-2,3,-4] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[1,-2,-3,4] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[1,-2,-3,-4] => [1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 10111000 => ? = 3
[-1,2,3,4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,2,3,-4] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[-1,2,-3,4] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[-1,2,-3,-4] => [1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 10111000 => ? = 3
[-1,-2,3,4] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[-1,-2,3,-4] => [1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 10111000 => ? = 3
[-1,-2,-3,4] => [1,1,1]
 => [1,0,1,1,1,0,0,0]
 => 10111000 => ? = 3
[-1,-2,-3,-4] => [1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => 1011110000 => ? = 6
[1,2,4,-3] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[1,2,-4,3] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[1,-2,4,3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,-2,4,-3] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[1,-2,-4,3] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[1,-2,-4,-3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,2,4,3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,2,4,-3] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-1,2,-4,3] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[-1,2,-4,-3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-2,4,3] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[-1,-2,4,-3] => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 10110100 => ? = 5
[-1,-2,-4,3] => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 10110100 => ? = 5
[-1,-2,-4,-3] => [1,1]
 => [1,0,1,1,0,0]
 => 101100 => ? = 1
[1,3,2,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,3,-2,4] => [2]
 => [1,1,0,0,1,0]
 => 110010 => ? = 0
[1,3,-2,-4] => [2,1]
 => [1,0,1,0,1,0]
 => 101010 => ? = 2
[1,-3,-2,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,3,2,4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-3,-2,4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,3,4,2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,3,-4,-2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-3,4,-2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-3,-4,2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,4,2,3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,4,-2,-3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-4,2,-3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-4,-2,3] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,4,-3,2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[1,-4,-3,-2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,4,3,2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-1,-4,3,-2] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,1,3,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,1,-3,4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-2,-1,3,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-2,-1,-3,4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,3,1,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,-3,-1,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-2,3,-1,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-2,-3,1,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,4,-3,1] => [1]
 => [1,0,1,0]
 => 1010 => 0
[2,-4,-3,-1] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-2,4,-3,-1] => [1]
 => [1,0,1,0]
 => 1010 => 0
[-2,-4,-3,1] => [1]
 => [1,0,1,0]
 => 1010 => 0
[3,1,2,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
[3,-1,-2,-4] => [1]
 => [1,0,1,0]
 => 1010 => 0
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.