Identifier
-
Mp00058:
Perfect matchings
—to permutation⟶
Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000374: Permutations ⟶ ℤ
Values
[(1,2)] => [2,1] => [1,1,0,0] => [2,3,1] => 1
[(1,2),(3,4)] => [2,1,4,3] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[(1,3),(2,4)] => [3,4,1,2] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 2
[(1,4),(2,3)] => [4,3,2,1] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 1
[(1,4),(2,3),(5,6)] => [4,3,2,1,6,5] => [1,1,1,1,0,0,0,0,1,1,0,0] => [2,3,4,6,1,7,5] => 2
[(1,6),(2,3),(4,5)] => [6,3,2,5,4,1] => [1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 1
[(1,6),(2,4),(3,5)] => [6,4,5,2,3,1] => [1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 1
[(1,4),(2,5),(3,6)] => [4,5,6,1,2,3] => [1,1,1,1,0,1,0,1,0,0,0,0] => [7,6,4,5,1,2,3] => 3
[(1,6),(2,5),(3,4)] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 1
[(1,8),(2,3),(4,5),(6,7)] => [8,3,2,5,4,7,6,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,4),(3,5),(6,7)] => [8,4,5,2,3,7,6,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,5),(3,4),(6,7)] => [8,5,4,3,2,7,6,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,6),(3,4),(5,7)] => [8,6,4,3,7,2,5,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,7),(3,4),(5,6)] => [8,7,4,3,6,5,2,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,7),(3,5),(4,6)] => [8,7,5,6,3,4,2,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,6),(3,5),(4,7)] => [8,6,5,7,3,2,4,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,5),(3,6),(4,7)] => [8,5,6,7,2,3,4,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,4),(3,6),(5,7)] => [8,4,6,2,7,3,5,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,3),(4,6),(5,7)] => [8,3,2,6,7,4,5,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,3),(4,7),(5,6)] => [8,3,2,7,6,5,4,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,4),(3,7),(5,6)] => [8,4,7,2,6,5,3,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,5),(3,7),(4,6)] => [8,5,7,6,2,4,3,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,6),(3,7),(4,5)] => [8,6,7,5,4,2,3,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,8),(2,7),(3,6),(4,5)] => [8,7,6,5,4,3,2,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[(1,10),(2,3),(4,5),(6,7),(8,9)] => [10,3,2,5,4,7,6,9,8,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,5),(3,4),(6,7),(8,9)] => [10,5,4,3,2,7,6,9,8,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,7),(3,4),(5,6),(8,9)] => [10,7,4,3,6,5,2,9,8,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,9),(3,4),(5,6),(7,8)] => [10,9,4,3,6,5,8,7,2,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,3),(4,7),(5,6),(8,9)] => [10,3,2,7,6,5,4,9,8,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,7),(3,6),(4,5),(8,9)] => [10,7,6,5,4,3,2,9,8,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,9),(3,6),(4,5),(7,8)] => [10,9,6,5,4,3,8,7,2,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,3),(4,9),(5,6),(7,8)] => [10,3,2,9,6,5,8,7,4,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,9),(3,8),(4,5),(6,7)] => [10,9,8,5,4,7,6,3,2,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,8),(3,9),(4,6),(5,7)] => [10,8,9,6,7,4,5,2,3,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,3),(4,5),(6,9),(7,8)] => [10,3,2,5,4,9,8,7,6,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,5),(3,4),(6,9),(7,8)] => [10,5,4,3,2,9,8,7,6,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,9),(3,4),(5,8),(6,7)] => [10,9,4,3,8,7,6,5,2,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,3),(4,9),(5,8),(6,7)] => [10,3,2,9,8,7,6,5,4,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
[(1,10),(2,9),(3,8),(4,7),(5,6)] => [10,9,8,7,6,5,4,3,2,1] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 1
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
left-to-right-maxima to Dyck path
Description
The left-to-right maxima of a permutation as a Dyck path.
Let $(c_1, \dots, c_k)$ be the rise composition Mp00102rise composition of the path. Then the corresponding left-to-right maxima are $c_1, c_1+c_2, \dots, c_1+\dots+c_k$.
Restricted to 321-avoiding permutations, this is the inverse of Mp00119to 321-avoiding permutation (Krattenthaler), restricted to 312-avoiding permutations, this is the inverse of Mp00031to 312-avoiding permutation.
Let $(c_1, \dots, c_k)$ be the rise composition Mp00102rise composition of the path. Then the corresponding left-to-right maxima are $c_1, c_1+c_2, \dots, c_1+\dots+c_k$.
Restricted to 321-avoiding permutations, this is the inverse of Mp00119to 321-avoiding permutation (Krattenthaler), restricted to 312-avoiding permutations, this is the inverse of Mp00031to 312-avoiding permutation.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
to permutation
Description
Returns the fixed point free involution whose transpositions are the pairs in the perfect matching.
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!