Identifier
-
Mp00068:
Permutations
—Simion-Schmidt map⟶
Permutations
Mp00223: Permutations —runsort⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
St001491: Binary words ⟶ ℤ
Values
[1,2,3] => [1,3,2] => [1,3,2] => 01 => 1
[1,3,2] => [1,3,2] => [1,3,2] => 01 => 1
[2,1,3] => [2,1,3] => [1,3,2] => 01 => 1
[1,2,3,4] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[1,2,4,3] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[1,3,2,4] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[1,3,4,2] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[1,4,2,3] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[1,4,3,2] => [1,4,3,2] => [1,4,2,3] => 010 => 1
[2,1,3,4] => [2,1,4,3] => [1,4,2,3] => 010 => 1
[2,1,4,3] => [2,1,4,3] => [1,4,2,3] => 010 => 1
[2,3,1,4] => [2,4,1,3] => [1,3,2,4] => 010 => 1
[2,3,4,1] => [2,4,3,1] => [1,2,4,3] => 001 => 1
[2,4,1,3] => [2,4,1,3] => [1,3,2,4] => 010 => 1
[2,4,3,1] => [2,4,3,1] => [1,2,4,3] => 001 => 1
[3,1,2,4] => [3,1,4,2] => [1,4,2,3] => 010 => 1
[3,1,4,2] => [3,1,4,2] => [1,4,2,3] => 010 => 1
[3,2,1,4] => [3,2,1,4] => [1,4,2,3] => 010 => 1
[3,2,4,1] => [3,2,4,1] => [1,2,4,3] => 001 => 1
[4,1,2,3] => [4,1,3,2] => [1,3,2,4] => 010 => 1
[4,1,3,2] => [4,1,3,2] => [1,3,2,4] => 010 => 1
[4,2,1,3] => [4,2,1,3] => [1,3,2,4] => 010 => 1
[1,2,3,4,5] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,2,3,5,4] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,2,4,3,5] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,2,4,5,3] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,2,5,3,4] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,2,5,4,3] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,3,2,4,5] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,3,2,5,4] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,3,4,2,5] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,3,4,5,2] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,3,5,2,4] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,3,5,4,2] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,4,2,3,5] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,4,2,5,3] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,4,3,2,5] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,4,3,5,2] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,4,5,2,3] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,4,5,3,2] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,5,2,3,4] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,5,2,4,3] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,5,3,2,4] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,5,3,4,2] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,5,4,2,3] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[1,5,4,3,2] => [1,5,4,3,2] => [1,5,2,3,4] => 0100 => 1
[2,1,3,4,5] => [2,1,5,4,3] => [1,5,2,3,4] => 0100 => 1
[2,1,3,5,4] => [2,1,5,4,3] => [1,5,2,3,4] => 0100 => 1
[2,1,4,3,5] => [2,1,5,4,3] => [1,5,2,3,4] => 0100 => 1
[2,1,4,5,3] => [2,1,5,4,3] => [1,5,2,3,4] => 0100 => 1
[2,1,5,3,4] => [2,1,5,4,3] => [1,5,2,3,4] => 0100 => 1
[2,1,5,4,3] => [2,1,5,4,3] => [1,5,2,3,4] => 0100 => 1
[2,3,1,4,5] => [2,5,1,4,3] => [1,4,2,5,3] => 0101 => 0
[2,3,1,5,4] => [2,5,1,4,3] => [1,4,2,5,3] => 0101 => 0
[2,3,4,1,5] => [2,5,4,1,3] => [1,3,2,5,4] => 0101 => 0
[2,3,4,5,1] => [2,5,4,3,1] => [1,2,5,3,4] => 0010 => 1
[2,3,5,1,4] => [2,5,4,1,3] => [1,3,2,5,4] => 0101 => 0
[2,3,5,4,1] => [2,5,4,3,1] => [1,2,5,3,4] => 0010 => 1
[2,4,1,3,5] => [2,5,1,4,3] => [1,4,2,5,3] => 0101 => 0
[2,4,1,5,3] => [2,5,1,4,3] => [1,4,2,5,3] => 0101 => 0
[2,4,3,1,5] => [2,5,4,1,3] => [1,3,2,5,4] => 0101 => 0
[2,4,3,5,1] => [2,5,4,3,1] => [1,2,5,3,4] => 0010 => 1
[2,4,5,1,3] => [2,5,4,1,3] => [1,3,2,5,4] => 0101 => 0
[2,4,5,3,1] => [2,5,4,3,1] => [1,2,5,3,4] => 0010 => 1
[2,5,1,3,4] => [2,5,1,4,3] => [1,4,2,5,3] => 0101 => 0
[2,5,1,4,3] => [2,5,1,4,3] => [1,4,2,5,3] => 0101 => 0
[2,5,3,1,4] => [2,5,4,1,3] => [1,3,2,5,4] => 0101 => 0
[2,5,3,4,1] => [2,5,4,3,1] => [1,2,5,3,4] => 0010 => 1
[2,5,4,1,3] => [2,5,4,1,3] => [1,3,2,5,4] => 0101 => 0
[2,5,4,3,1] => [2,5,4,3,1] => [1,2,5,3,4] => 0010 => 1
[3,1,2,4,5] => [3,1,5,4,2] => [1,5,2,3,4] => 0100 => 1
[3,1,2,5,4] => [3,1,5,4,2] => [1,5,2,3,4] => 0100 => 1
[3,1,4,2,5] => [3,1,5,4,2] => [1,5,2,3,4] => 0100 => 1
[3,1,4,5,2] => [3,1,5,4,2] => [1,5,2,3,4] => 0100 => 1
[3,1,5,2,4] => [3,1,5,4,2] => [1,5,2,3,4] => 0100 => 1
[3,1,5,4,2] => [3,1,5,4,2] => [1,5,2,3,4] => 0100 => 1
[3,2,1,4,5] => [3,2,1,5,4] => [1,5,2,3,4] => 0100 => 1
[3,2,1,5,4] => [3,2,1,5,4] => [1,5,2,3,4] => 0100 => 1
[3,2,4,1,5] => [3,2,5,1,4] => [1,4,2,5,3] => 0101 => 0
[3,2,4,5,1] => [3,2,5,4,1] => [1,2,5,3,4] => 0010 => 1
[3,2,5,1,4] => [3,2,5,1,4] => [1,4,2,5,3] => 0101 => 0
[3,2,5,4,1] => [3,2,5,4,1] => [1,2,5,3,4] => 0010 => 1
[3,4,1,2,5] => [3,5,1,4,2] => [1,4,2,3,5] => 0100 => 1
[3,4,1,5,2] => [3,5,1,4,2] => [1,4,2,3,5] => 0100 => 1
[3,4,2,1,5] => [3,5,2,1,4] => [1,4,2,3,5] => 0100 => 1
[3,4,2,5,1] => [3,5,2,4,1] => [1,2,4,3,5] => 0010 => 1
[3,4,5,1,2] => [3,5,4,1,2] => [1,2,3,5,4] => 0001 => 1
[3,4,5,2,1] => [3,5,4,2,1] => [1,2,3,5,4] => 0001 => 1
[3,5,1,2,4] => [3,5,1,4,2] => [1,4,2,3,5] => 0100 => 1
[3,5,1,4,2] => [3,5,1,4,2] => [1,4,2,3,5] => 0100 => 1
[3,5,2,1,4] => [3,5,2,1,4] => [1,4,2,3,5] => 0100 => 1
[3,5,2,4,1] => [3,5,2,4,1] => [1,2,4,3,5] => 0010 => 1
[3,5,4,1,2] => [3,5,4,1,2] => [1,2,3,5,4] => 0001 => 1
[3,5,4,2,1] => [3,5,4,2,1] => [1,2,3,5,4] => 0001 => 1
[4,1,2,3,5] => [4,1,5,3,2] => [1,5,2,3,4] => 0100 => 1
[4,1,2,5,3] => [4,1,5,3,2] => [1,5,2,3,4] => 0100 => 1
[4,1,3,2,5] => [4,1,5,3,2] => [1,5,2,3,4] => 0100 => 1
[4,1,3,5,2] => [4,1,5,3,2] => [1,5,2,3,4] => 0100 => 1
[4,1,5,2,3] => [4,1,5,3,2] => [1,5,2,3,4] => 0100 => 1
[4,1,5,3,2] => [4,1,5,3,2] => [1,5,2,3,4] => 0100 => 1
[4,2,1,3,5] => [4,2,1,5,3] => [1,5,2,3,4] => 0100 => 1
>>> Load all 134 entries. <<<
search for individual values
searching the database for the individual values of this statistic
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
runsort
Description
The permutation obtained by sorting the increasing runs lexicographically.
Map
descent word
Description
The descent positions of a permutation as a binary word.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.
Map
Simion-Schmidt map
Description
The Simion-Schmidt map sends any permutation to a $123$-avoiding permutation.
Details can be found in [1].
In particular, this is a bijection between $132$-avoiding permutations and $123$-avoiding permutations, see [1, Proposition 19].
Details can be found in [1].
In particular, this is a bijection between $132$-avoiding permutations and $123$-avoiding permutations, see [1, Proposition 19].
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!