Identifier
-
Mp00095:
Integer partitions
—to binary word⟶
Binary words
Mp00158: Binary words —alternating inverse⟶ Binary words
Mp00273: Binary words —Gray previous⟶ Binary words
St001491: Binary words ⟶ ℤ
Values
[1] => 10 => 11 => 10 => 1
[2] => 100 => 110 => 100 => 1
[3] => 1000 => 1101 => 0101 => 0
[2,1] => 1010 => 1111 => 1011 => 2
[1,1,1] => 1110 => 1011 => 0011 => 1
[2,2] => 1100 => 1001 => 1101 => 2
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
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.
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.
Map
to binary word
Description
Return the partition as binary word, by traversing its shape from the first row to the last row, down steps as 1 and left steps as 0.
Map
alternating inverse
Description
Sends a binary word $w_1\cdots w_m$ to the binary word $v_1 \cdots v_m$ with $v_i = w_i$ if $i$ is odd and $v_i = 1 - w_i$ if $i$ is even.
This map is used in [1], see Definitions 3.2 and 5.1.
This map is used in [1], see Definitions 3.2 and 5.1.
Map
Gray previous
Description
The previous element in the Gray code for binary words.
Let $w$ be a binary word. If the number of ones in $w$ is odd, return the binary word obtained by flipping the first bit of $w$. If $w$ has only zeros, return the word with the final bit flipped. Otherwise, return the word obtained by flipping the bit after the first one.
Let $w$ be a binary word. If the number of ones in $w$ is odd, return the binary word obtained by flipping the first bit of $w$. If $w$ has only zeros, return the word with the final bit flipped. Otherwise, return the word obtained by flipping the bit after the first one.
searching the database
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!