Identifier
-
Mp00226:
Standard tableaux
—row-to-column-descents⟶
Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000374: Permutations ⟶ ℤ
Values
[[1]] => [[1]] => [1] => [1] => 0
[[1,2]] => [[1,2]] => [1,2] => [1,2] => 0
[[1],[2]] => [[1],[2]] => [2,1] => [2,1] => 1
[[1,2,3]] => [[1,2,3]] => [1,2,3] => [1,3,2] => 1
[[1,3],[2]] => [[1,2],[3]] => [3,1,2] => [3,1,2] => 2
[[1,2],[3]] => [[1,3],[2]] => [2,1,3] => [2,1,3] => 1
[[1],[2],[3]] => [[1],[2],[3]] => [3,2,1] => [3,2,1] => 1
[[1,2,3,4]] => [[1,2,3,4]] => [1,2,3,4] => [1,4,3,2] => 1
[[1,3,4],[2]] => [[1,2,4],[3]] => [3,1,2,4] => [3,1,4,2] => 2
[[1,2,4],[3]] => [[1,2,3],[4]] => [4,1,2,3] => [4,1,3,2] => 2
[[1,2,3],[4]] => [[1,3,4],[2]] => [2,1,3,4] => [2,1,4,3] => 2
[[1,3],[2,4]] => [[1,2],[3,4]] => [3,4,1,2] => [3,4,1,2] => 2
[[1,2],[3,4]] => [[1,3],[2,4]] => [2,4,1,3] => [2,4,1,3] => 2
[[1,4],[2],[3]] => [[1,3],[2],[4]] => [4,2,1,3] => [4,2,1,3] => 2
[[1,3],[2],[4]] => [[1,2],[3],[4]] => [4,3,1,2] => [4,3,1,2] => 2
[[1,2],[3],[4]] => [[1,4],[2],[3]] => [3,2,1,4] => [3,2,1,4] => 1
[[1],[2],[3],[4]] => [[1],[2],[3],[4]] => [4,3,2,1] => [4,3,2,1] => 1
[[1,2,3,4,5]] => [[1,2,3,4,5]] => [1,2,3,4,5] => [1,5,4,3,2] => 1
[[1,3,4,5],[2]] => [[1,2,4,5],[3]] => [3,1,2,4,5] => [3,1,5,4,2] => 2
[[1,2,4,5],[3]] => [[1,2,3,5],[4]] => [4,1,2,3,5] => [4,1,5,3,2] => 2
[[1,2,3,5],[4]] => [[1,2,3,4],[5]] => [5,1,2,3,4] => [5,1,4,3,2] => 2
[[1,2,3,4],[5]] => [[1,3,4,5],[2]] => [2,1,3,4,5] => [2,1,5,4,3] => 2
[[1,3,5],[2,4]] => [[1,2,4],[3,5]] => [3,5,1,2,4] => [3,5,1,4,2] => 2
[[1,2,5],[3,4]] => [[1,3,4],[2,5]] => [2,5,1,3,4] => [2,5,1,4,3] => 2
[[1,3,4],[2,5]] => [[1,2,5],[3,4]] => [3,4,1,2,5] => [3,5,1,4,2] => 2
[[1,2,4],[3,5]] => [[1,2,3],[4,5]] => [4,5,1,2,3] => [4,5,1,3,2] => 2
[[1,2,3],[4,5]] => [[1,3,5],[2,4]] => [2,4,1,3,5] => [2,5,1,4,3] => 2
[[1,4,5],[2],[3]] => [[1,3,5],[2],[4]] => [4,2,1,3,5] => [4,2,1,5,3] => 2
[[1,3,5],[2],[4]] => [[1,2,4],[3],[5]] => [5,3,1,2,4] => [5,3,1,4,2] => 2
[[1,2,5],[3],[4]] => [[1,3,4],[2],[5]] => [5,2,1,3,4] => [5,2,1,4,3] => 2
[[1,3,4],[2],[5]] => [[1,2,5],[3],[4]] => [4,3,1,2,5] => [4,3,1,5,2] => 2
[[1,2,4],[3],[5]] => [[1,2,3],[4],[5]] => [5,4,1,2,3] => [5,4,1,3,2] => 2
[[1,2,3],[4],[5]] => [[1,4,5],[2],[3]] => [3,2,1,4,5] => [3,2,1,5,4] => 2
[[1,4],[2,5],[3]] => [[1,3],[2,5],[4]] => [4,2,5,1,3] => [4,2,5,1,3] => 2
[[1,3],[2,5],[4]] => [[1,2],[3,4],[5]] => [5,3,4,1,2] => [5,3,4,1,2] => 2
[[1,2],[3,5],[4]] => [[1,3],[2,4],[5]] => [5,2,4,1,3] => [5,2,4,1,3] => 2
[[1,3],[2,4],[5]] => [[1,2],[3,5],[4]] => [4,3,5,1,2] => [4,3,5,1,2] => 2
[[1,2],[3,4],[5]] => [[1,4],[2,5],[3]] => [3,2,5,1,4] => [3,2,5,1,4] => 2
[[1,5],[2],[3],[4]] => [[1,4],[2],[3],[5]] => [5,3,2,1,4] => [5,3,2,1,4] => 2
[[1,4],[2],[3],[5]] => [[1,3],[2],[4],[5]] => [5,4,2,1,3] => [5,4,2,1,3] => 2
[[1,3],[2],[4],[5]] => [[1,2],[3],[4],[5]] => [5,4,3,1,2] => [5,4,3,1,2] => 2
[[1,2],[3],[4],[5]] => [[1,5],[2],[3],[4]] => [4,3,2,1,5] => [4,3,2,1,5] => 1
[[1],[2],[3],[4],[5]] => [[1],[2],[3],[4],[5]] => [5,4,3,2,1] => [5,4,3,2,1] => 1
[[1,2,3,4,5,6]] => [[1,2,3,4,5,6]] => [1,2,3,4,5,6] => [1,6,5,4,3,2] => 1
[[1,3,4,5,6],[2]] => [[1,2,4,5,6],[3]] => [3,1,2,4,5,6] => [3,1,6,5,4,2] => 2
[[1,2,4,5,6],[3]] => [[1,2,3,5,6],[4]] => [4,1,2,3,5,6] => [4,1,6,5,3,2] => 2
[[1,2,3,5,6],[4]] => [[1,2,3,4,6],[5]] => [5,1,2,3,4,6] => [5,1,6,4,3,2] => 2
[[1,2,3,4,6],[5]] => [[1,2,3,4,5],[6]] => [6,1,2,3,4,5] => [6,1,5,4,3,2] => 2
[[1,2,3,4,5],[6]] => [[1,3,4,5,6],[2]] => [2,1,3,4,5,6] => [2,1,6,5,4,3] => 2
[[1,3,5,6],[2,4]] => [[1,2,4,6],[3,5]] => [3,5,1,2,4,6] => [3,6,1,5,4,2] => 2
[[1,2,5,6],[3,4]] => [[1,3,4,6],[2,5]] => [2,5,1,3,4,6] => [2,6,1,5,4,3] => 2
[[1,3,4,6],[2,5]] => [[1,2,4,5],[3,6]] => [3,6,1,2,4,5] => [3,6,1,5,4,2] => 2
[[1,2,4,6],[3,5]] => [[1,2,3,5],[4,6]] => [4,6,1,2,3,5] => [4,6,1,5,3,2] => 2
[[1,2,3,6],[4,5]] => [[1,3,4,5],[2,6]] => [2,6,1,3,4,5] => [2,6,1,5,4,3] => 2
[[1,3,4,5],[2,6]] => [[1,2,5,6],[3,4]] => [3,4,1,2,5,6] => [3,6,1,5,4,2] => 2
[[1,2,4,5],[3,6]] => [[1,2,3,6],[4,5]] => [4,5,1,2,3,6] => [4,6,1,5,3,2] => 2
[[1,2,3,5],[4,6]] => [[1,2,3,4],[5,6]] => [5,6,1,2,3,4] => [5,6,1,4,3,2] => 2
[[1,2,3,4],[5,6]] => [[1,3,5,6],[2,4]] => [2,4,1,3,5,6] => [2,6,1,5,4,3] => 2
[[1,4,5,6],[2],[3]] => [[1,3,5,6],[2],[4]] => [4,2,1,3,5,6] => [4,2,1,6,5,3] => 2
[[1,3,5,6],[2],[4]] => [[1,2,4,6],[3],[5]] => [5,3,1,2,4,6] => [5,3,1,6,4,2] => 2
[[1,2,5,6],[3],[4]] => [[1,3,4,6],[2],[5]] => [5,2,1,3,4,6] => [5,2,1,6,4,3] => 2
[[1,3,4,6],[2],[5]] => [[1,2,4,5],[3],[6]] => [6,3,1,2,4,5] => [6,3,1,5,4,2] => 2
[[1,2,4,6],[3],[5]] => [[1,2,3,5],[4],[6]] => [6,4,1,2,3,5] => [6,4,1,5,3,2] => 2
[[1,2,3,6],[4],[5]] => [[1,3,4,5],[2],[6]] => [6,2,1,3,4,5] => [6,2,1,5,4,3] => 2
[[1,3,4,5],[2],[6]] => [[1,2,5,6],[3],[4]] => [4,3,1,2,5,6] => [4,3,1,6,5,2] => 2
[[1,2,4,5],[3],[6]] => [[1,2,3,6],[4],[5]] => [5,4,1,2,3,6] => [5,4,1,6,3,2] => 2
[[1,2,3,5],[4],[6]] => [[1,2,3,4],[5],[6]] => [6,5,1,2,3,4] => [6,5,1,4,3,2] => 2
[[1,2,3,4],[5],[6]] => [[1,4,5,6],[2],[3]] => [3,2,1,4,5,6] => [3,2,1,6,5,4] => 2
[[1,3,5],[2,4,6]] => [[1,2,4],[3,5,6]] => [3,5,6,1,2,4] => [3,6,5,1,4,2] => 2
[[1,2,5],[3,4,6]] => [[1,3,4],[2,5,6]] => [2,5,6,1,3,4] => [2,6,5,1,4,3] => 2
[[1,3,4],[2,5,6]] => [[1,2,5],[3,4,6]] => [3,4,6,1,2,5] => [3,6,5,1,4,2] => 2
[[1,2,4],[3,5,6]] => [[1,2,3],[4,5,6]] => [4,5,6,1,2,3] => [4,6,5,1,3,2] => 2
[[1,2,3],[4,5,6]] => [[1,3,5],[2,4,6]] => [2,4,6,1,3,5] => [2,6,5,1,4,3] => 2
[[1,4,6],[2,5],[3]] => [[1,3,5],[2,6],[4]] => [4,2,6,1,3,5] => [4,2,6,1,5,3] => 2
[[1,3,6],[2,5],[4]] => [[1,2,4],[3,5],[6]] => [6,3,5,1,2,4] => [6,3,5,1,4,2] => 2
[[1,2,6],[3,5],[4]] => [[1,3,4],[2,5],[6]] => [6,2,5,1,3,4] => [6,2,5,1,4,3] => 2
[[1,3,6],[2,4],[5]] => [[1,2,5],[3,4],[6]] => [6,3,4,1,2,5] => [6,3,5,1,4,2] => 2
[[1,2,6],[3,4],[5]] => [[1,3,5],[2,4],[6]] => [6,2,4,1,3,5] => [6,2,5,1,4,3] => 2
[[1,4,5],[2,6],[3]] => [[1,3,6],[2,5],[4]] => [4,2,5,1,3,6] => [4,2,6,1,5,3] => 2
[[1,3,5],[2,6],[4]] => [[1,2,6],[3,4],[5]] => [5,3,4,1,2,6] => [5,3,6,1,4,2] => 2
[[1,2,5],[3,6],[4]] => [[1,3,6],[2,4],[5]] => [5,2,4,1,3,6] => [5,2,6,1,4,3] => 2
[[1,3,4],[2,6],[5]] => [[1,2,5],[3,6],[4]] => [4,3,6,1,2,5] => [4,3,6,1,5,2] => 2
[[1,2,4],[3,6],[5]] => [[1,2,3],[4,5],[6]] => [6,4,5,1,2,3] => [6,4,5,1,3,2] => 2
[[1,2,3],[4,6],[5]] => [[1,4,5],[2,6],[3]] => [3,2,6,1,4,5] => [3,2,6,1,5,4] => 2
[[1,3,5],[2,4],[6]] => [[1,2,4],[3,6],[5]] => [5,3,6,1,2,4] => [5,3,6,1,4,2] => 2
[[1,2,5],[3,4],[6]] => [[1,3,4],[2,6],[5]] => [5,2,6,1,3,4] => [5,2,6,1,4,3] => 2
[[1,3,4],[2,5],[6]] => [[1,2,6],[3,5],[4]] => [4,3,5,1,2,6] => [4,3,6,1,5,2] => 2
[[1,2,4],[3,5],[6]] => [[1,2,3],[4,6],[5]] => [5,4,6,1,2,3] => [5,4,6,1,3,2] => 2
[[1,2,3],[4,5],[6]] => [[1,4,6],[2,5],[3]] => [3,2,5,1,4,6] => [3,2,6,1,5,4] => 2
[[1,5,6],[2],[3],[4]] => [[1,4,6],[2],[3],[5]] => [5,3,2,1,4,6] => [5,3,2,1,6,4] => 2
[[1,4,6],[2],[3],[5]] => [[1,3,5],[2],[4],[6]] => [6,4,2,1,3,5] => [6,4,2,1,5,3] => 2
[[1,3,6],[2],[4],[5]] => [[1,2,5],[3],[4],[6]] => [6,4,3,1,2,5] => [6,4,3,1,5,2] => 2
[[1,2,6],[3],[4],[5]] => [[1,4,5],[2],[3],[6]] => [6,3,2,1,4,5] => [6,3,2,1,5,4] => 2
[[1,4,5],[2],[3],[6]] => [[1,3,6],[2],[4],[5]] => [5,4,2,1,3,6] => [5,4,2,1,6,3] => 2
[[1,3,5],[2],[4],[6]] => [[1,2,4],[3],[5],[6]] => [6,5,3,1,2,4] => [6,5,3,1,4,2] => 2
[[1,2,5],[3],[4],[6]] => [[1,3,4],[2],[5],[6]] => [6,5,2,1,3,4] => [6,5,2,1,4,3] => 2
[[1,3,4],[2],[5],[6]] => [[1,2,6],[3],[4],[5]] => [5,4,3,1,2,6] => [5,4,3,1,6,2] => 2
[[1,2,4],[3],[5],[6]] => [[1,2,3],[4],[5],[6]] => [6,5,4,1,2,3] => [6,5,4,1,3,2] => 2
[[1,2,3],[4],[5],[6]] => [[1,5,6],[2],[3],[4]] => [4,3,2,1,5,6] => [4,3,2,1,6,5] => 2
[[1,4],[2,5],[3,6]] => [[1,3],[2,5],[4,6]] => [4,6,2,5,1,3] => [4,6,2,5,1,3] => 2
[[1,3],[2,5],[4,6]] => [[1,2],[3,4],[5,6]] => [5,6,3,4,1,2] => [5,6,3,4,1,2] => 2
>>> Load all 202 entries. <<<
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 exclusive right-to-left minima of a permutation.
This is the number of right-to-left minima that are not left-to-right maxima.
This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3.
Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there do not exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$.
See also St000213The number of weak exceedances (also weak excedences) of a permutation. and St000119The number of occurrences of the pattern 321 in a permutation..
This is the number of right-to-left minima that are not left-to-right maxima.
This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3.
Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there do not exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$.
See also St000213The number of weak exceedances (also weak excedences) of a permutation. and St000119The number of occurrences of the pattern 321 in a permutation..
Map
reading word permutation
Description
Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.
Map
row-to-column-descents
Description
Return a standard tableau whose column descent set equals the row descent set of the original tableau.
A column descent in a standard tableau is an entry $i$ such that $i+1$ appears in a column to the left of the cell containing $i$, in English notation.
A row descent is an entry $i$ such that $i+1$ appears in a row above of the cell containing $i$.
A column descent in a standard tableau is an entry $i$ such that $i+1$ appears in a column to the left of the cell containing $i$, in English notation.
A row descent is an entry $i$ such that $i+1$ appears in a row above of the cell containing $i$.
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!