Identifier
-
Mp00241:
Permutations
—invert Laguerre heap⟶
Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
St001207: Permutations ⟶ ℤ
Values
[1,2] => [1,2] => [1,2] => [1,2] => 0
[2,1] => [2,1] => [2,1] => [2,1] => 1
[1,2,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,3,2] => [1,3,2] => 1
[2,1,3] => [2,1,3] => [2,1,3] => [2,1,3] => 1
[2,3,1] => [3,1,2] => [3,2,1] => [2,3,1] => 2
[3,1,2] => [2,3,1] => [3,2,1] => [2,3,1] => 2
[3,2,1] => [3,2,1] => [3,2,1] => [2,3,1] => 2
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,3,2,4] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,3,4,2] => [1,4,2,3] => [1,4,3,2] => [1,3,4,2] => 2
[1,4,2,3] => [1,3,4,2] => [1,4,3,2] => [1,3,4,2] => 2
[1,4,3,2] => [1,4,3,2] => [1,4,3,2] => [1,3,4,2] => 2
[2,1,3,4] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[2,1,4,3] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 1
[2,3,1,4] => [3,1,2,4] => [3,2,1,4] => [2,3,1,4] => 2
[2,3,4,1] => [4,1,2,3] => [4,2,3,1] => [2,3,4,1] => 3
[2,4,1,3] => [3,4,1,2] => [4,3,2,1] => [3,2,4,1] => 3
[2,4,3,1] => [4,3,1,2] => [4,3,2,1] => [3,2,4,1] => 3
[3,1,2,4] => [2,3,1,4] => [3,2,1,4] => [2,3,1,4] => 2
[3,1,4,2] => [4,2,3,1] => [4,3,2,1] => [3,2,4,1] => 3
[3,2,1,4] => [3,2,1,4] => [3,2,1,4] => [2,3,1,4] => 2
[3,2,4,1] => [4,1,3,2] => [4,2,3,1] => [2,3,4,1] => 3
[3,4,1,2] => [2,4,1,3] => [3,4,1,2] => [3,1,4,2] => 2
[3,4,2,1] => [4,2,1,3] => [4,3,2,1] => [3,2,4,1] => 3
[4,1,2,3] => [2,3,4,1] => [4,2,3,1] => [2,3,4,1] => 3
[4,1,3,2] => [3,2,4,1] => [4,2,3,1] => [2,3,4,1] => 3
[4,2,1,3] => [3,4,2,1] => [4,3,2,1] => [3,2,4,1] => 3
[4,2,3,1] => [3,1,4,2] => [4,2,3,1] => [2,3,4,1] => 3
[4,3,1,2] => [2,4,3,1] => [4,3,2,1] => [3,2,4,1] => 3
[4,3,2,1] => [4,3,2,1] => [4,3,2,1] => [3,2,4,1] => 3
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 Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.
Map
Demazure product with inverse
Description
This map sends a permutation $\pi$ to $\pi^{-1} \star \pi$ where $\star$ denotes the Demazure product on permutations.
This map is a surjection onto the set of involutions, i.e., the set of permutations $\pi$ for which $\pi = \pi^{-1}$.
This map is a surjection onto the set of involutions, i.e., the set of permutations $\pi$ for which $\pi = \pi^{-1}$.
Map
invert Laguerre heap
Description
The permutation obtained by inverting the corresponding Laguerre heap, according to Viennot.
Let $\pi$ be a permutation. Following Viennot [1], we associate to $\pi$ a heap of pieces, by considering each decreasing run $(\pi_i, \pi_{i+1}, \dots, \pi_j)$ of $\pi$ as one piece, beginning with the left most run. Two pieces commute if and only if the minimal element of one piece is larger than the maximal element of the other piece.
This map yields the permutation corresponding to the heap obtained by reversing the reading direction of the heap.
Equivalently, this is the permutation obtained by flipping the noncrossing arc diagram of Reading [2] vertically.
By definition, this map preserves the set of decreasing runs.
Let $\pi$ be a permutation. Following Viennot [1], we associate to $\pi$ a heap of pieces, by considering each decreasing run $(\pi_i, \pi_{i+1}, \dots, \pi_j)$ of $\pi$ as one piece, beginning with the left most run. Two pieces commute if and only if the minimal element of one piece is larger than the maximal element of the other piece.
This map yields the permutation corresponding to the heap obtained by reversing the reading direction of the heap.
Equivalently, this is the permutation obtained by flipping the noncrossing arc diagram of Reading [2] vertically.
By definition, this map preserves the set of decreasing runs.
Map
inverse first fundamental transformation
Description
Let $\sigma = (i_{11}\cdots i_{1k_1})\cdots(i_{\ell 1}\cdots i_{\ell k_\ell})$ be a permutation given by cycle notation such that every cycle starts with its maximal entry, and all cycles are ordered increasingly by these maximal entries.
Maps $\sigma$ to the permutation $[i_{11},\ldots,i_{1k_1},\ldots,i_{\ell 1},\ldots,i_{\ell k_\ell}]$ in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the cycles.
Maps $\sigma$ to the permutation $[i_{11},\ldots,i_{1k_1},\ldots,i_{\ell 1},\ldots,i_{\ell k_\ell}]$ in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the cycles.
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!