Identifier
-
Mp00119:
Dyck paths
—to 321-avoiding permutation (Krattenthaler)⟶
Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00326: Permutations —weak order rowmotion⟶ Permutations
St000651: Permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => [1] => 0
[1,0,1,0] => [1,2] => [1,2] => [2,1] => 0
[1,1,0,0] => [2,1] => [2,1] => [1,2] => 1
[1,0,1,0,1,0] => [1,2,3] => [1,2,3] => [3,2,1] => 0
[1,0,1,1,0,0] => [1,3,2] => [1,3,2] => [2,3,1] => 1
[1,1,0,0,1,0] => [2,1,3] => [2,1,3] => [3,1,2] => 1
[1,1,0,1,0,0] => [2,3,1] => [3,1,2] => [1,3,2] => 2
[1,1,1,0,0,0] => [3,1,2] => [3,2,1] => [1,2,3] => 1
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => [4,3,2,1] => 0
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [1,2,4,3] => [3,4,2,1] => 1
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [1,3,2,4] => [4,2,3,1] => 1
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [1,4,2,3] => [2,4,3,1] => 2
[1,0,1,1,1,0,0,0] => [1,4,2,3] => [1,4,3,2] => [2,3,4,1] => 1
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [2,1,3,4] => [4,3,1,2] => 1
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [2,1,4,3] => [3,4,1,2] => 1
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [3,1,2,4] => [4,1,3,2] => 2
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [4,1,2,3] => [1,4,3,2] => 3
[1,1,0,1,1,0,0,0] => [2,4,1,3] => [4,3,1,2] => [1,3,4,2] => 2
[1,1,1,0,0,0,1,0] => [3,1,2,4] => [3,2,1,4] => [4,1,2,3] => 1
[1,1,1,0,0,1,0,0] => [3,1,4,2] => [4,2,1,3] => [1,2,4,3] => 2
[1,1,1,0,1,0,0,0] => [3,4,1,2] => [3,1,4,2] => [1,3,2,4] => 2
[1,1,1,1,0,0,0,0] => [4,1,2,3] => [4,3,2,1] => [1,2,3,4] => 1
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [1,2,3,5,4] => [4,5,3,2,1] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [1,2,4,3,5] => [5,3,4,2,1] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [1,2,5,3,4] => [3,5,4,2,1] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => [1,2,5,4,3] => [3,4,5,2,1] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [1,3,2,4,5] => [5,4,2,3,1] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,3,2,5,4] => [4,5,2,3,1] => 1
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [1,4,2,3,5] => [5,2,4,3,1] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [1,5,2,3,4] => [2,5,4,3,1] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,2,4] => [1,5,4,2,3] => [2,4,5,3,1] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => [1,4,3,2,5] => [5,2,3,4,1] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,4,2,5,3] => [1,5,3,2,4] => [2,3,5,4,1] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,4,5,2,3] => [1,4,2,5,3] => [2,4,3,5,1] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => [1,5,4,3,2] => [2,3,4,5,1] => 1
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [2,1,3,4,5] => [5,4,3,1,2] => 1
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [2,1,3,5,4] => [4,5,3,1,2] => 1
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [2,1,4,3,5] => [5,3,4,1,2] => 1
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [2,1,5,3,4] => [3,5,4,1,2] => 2
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => [2,1,5,4,3] => [3,4,5,1,2] => 1
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [3,1,2,4,5] => [5,4,1,3,2] => 2
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [3,1,2,5,4] => [4,5,1,3,2] => 2
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [4,1,2,3,5] => [5,1,4,3,2] => 3
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [5,1,2,3,4] => [1,5,4,3,2] => 4
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,1,4] => [5,4,1,2,3] => [1,4,5,3,2] => 3
[1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,5] => [4,3,1,2,5] => [5,1,3,4,2] => 2
[1,1,0,1,1,0,0,1,0,0] => [2,4,1,5,3] => [5,3,1,2,4] => [1,3,5,4,2] => 2
[1,1,0,1,1,0,1,0,0,0] => [2,4,5,1,3] => [4,1,2,5,3] => [1,4,3,5,2] => 3
[1,1,0,1,1,1,0,0,0,0] => [2,5,1,3,4] => [5,4,3,1,2] => [1,3,4,5,2] => 2
[1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => [3,2,1,4,5] => [5,4,1,2,3] => 1
[1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => [3,2,1,5,4] => [4,5,1,2,3] => 1
[1,1,1,0,0,1,0,0,1,0] => [3,1,4,2,5] => [4,2,1,3,5] => [5,1,2,4,3] => 2
[1,1,1,0,0,1,0,1,0,0] => [3,1,4,5,2] => [5,2,1,3,4] => [1,2,5,4,3] => 3
[1,1,1,0,0,1,1,0,0,0] => [3,1,5,2,4] => [5,4,2,1,3] => [1,2,4,5,3] => 2
[1,1,1,0,1,0,0,0,1,0] => [3,4,1,2,5] => [3,1,4,2,5] => [5,1,3,2,4] => 2
[1,1,1,0,1,0,0,1,0,0] => [3,4,1,5,2] => [3,1,5,2,4] => [1,3,2,5,4] => 3
[1,1,1,0,1,0,1,0,0,0] => [3,4,5,1,2] => [5,2,4,1,3] => [2,5,1,4,3] => 3
[1,1,1,0,1,1,0,0,0,0] => [3,5,1,2,4] => [3,1,5,4,2] => [1,3,2,4,5] => 2
[1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => [4,3,2,1,5] => [5,1,2,3,4] => 1
[1,1,1,1,0,0,0,1,0,0] => [4,1,2,5,3] => [5,3,2,1,4] => [1,2,3,5,4] => 2
[1,1,1,1,0,0,1,0,0,0] => [4,1,5,2,3] => [4,2,1,5,3] => [1,2,4,3,5] => 2
[1,1,1,1,0,1,0,0,0,0] => [4,5,1,2,3] => [5,3,1,4,2] => [1,3,5,2,4] => 2
[1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => [5,4,3,2,1] => [1,2,3,4,5] => 1
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => [6,5,4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [1,2,3,4,6,5] => [5,6,4,3,2,1] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [1,2,3,5,4,6] => [6,4,5,3,2,1] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [1,2,3,6,4,5] => [4,6,5,3,2,1] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,4,5] => [1,2,3,6,5,4] => [4,5,6,3,2,1] => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [1,2,4,3,5,6] => [6,5,3,4,2,1] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,4,3,6,5] => [5,6,3,4,2,1] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [1,2,5,3,4,6] => [6,3,5,4,2,1] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [1,2,6,3,4,5] => [3,6,5,4,2,1] => 3
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,3,5] => [1,2,6,5,3,4] => [3,5,6,4,2,1] => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,3,4,6] => [1,2,5,4,3,6] => [6,3,4,5,2,1] => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,3,6,4] => [1,2,6,4,3,5] => [3,4,6,5,2,1] => 2
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,5,6,3,4] => [1,2,5,3,6,4] => [3,5,4,6,2,1] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,3,4,5] => [1,2,6,5,4,3] => [3,4,5,6,2,1] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [1,3,2,4,5,6] => [6,5,4,2,3,1] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [1,3,2,4,6,5] => [5,6,4,2,3,1] => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [1,3,2,5,4,6] => [6,4,5,2,3,1] => 1
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [1,3,2,6,4,5] => [4,6,5,2,3,1] => 2
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,4,5] => [1,3,2,6,5,4] => [4,5,6,2,3,1] => 1
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [1,4,2,3,5,6] => [6,5,2,4,3,1] => 2
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [1,4,2,3,6,5] => [5,6,2,4,3,1] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [1,5,2,3,4,6] => [6,2,5,4,3,1] => 3
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [1,6,2,3,4,5] => [2,6,5,4,3,1] => 4
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,2,5] => [1,6,5,2,3,4] => [2,5,6,4,3,1] => 3
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,2,4,6] => [1,5,4,2,3,6] => [6,2,4,5,3,1] => 2
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,2,6,4] => [1,6,4,2,3,5] => [2,4,6,5,3,1] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,5,6,2,4] => [1,5,2,3,6,4] => [2,5,4,6,3,1] => 3
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,2,4,5] => [1,6,5,4,2,3] => [2,4,5,6,3,1] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,2,3,5,6] => [1,4,3,2,5,6] => [6,5,2,3,4,1] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,2,3,6,5] => [1,4,3,2,6,5] => [5,6,2,3,4,1] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,2,5,3,6] => [1,5,3,2,4,6] => [6,2,3,5,4,1] => 2
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,2,5,6,3] => [1,6,3,2,4,5] => [2,3,6,5,4,1] => 3
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,2,6,3,5] => [1,6,5,3,2,4] => [2,3,5,6,4,1] => 2
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,4,5,2,3,6] => [1,4,2,5,3,6] => [6,2,4,3,5,1] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,4,5,2,6,3] => [1,4,2,6,3,5] => [2,4,3,6,5,1] => 3
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,4,5,6,2,3] => [1,6,3,5,2,4] => [3,6,2,5,4,1] => 3
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,4,6,2,3,5] => [1,4,2,6,5,3] => [2,4,3,5,6,1] => 2
>>> Load all 304 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 maximal size of a rise in a permutation.
This is $\max_i \sigma_{i+1}-\sigma_i$, except for the permutations without rises, where it is $0$.
This is $\max_i \sigma_{i+1}-\sigma_i$, except for the permutations without rises, where it is $0$.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
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.
Map
weak order rowmotion
Description
Return the reversal of the permutation obtained by inverting the corresponding Laguerre heap.
This map is the composite of Mp00241invert Laguerre heap and Mp00064reverse.
Conjecturally, it is also the rowmotion on the weak order:
Any semidistributive lattice $L$ has a canonical labeling of the edges of its Hasse diagram by its join irreducible elements (see [1] and [2]). Rowmotion on this lattice is the bijection which takes an element $x \in L$ with a given set of down-labels to the unique element $y \in L$ which has that set as its up-labels (see [2] and [3]). For example, if the lattice is the distributive lattice $J(P)$ of order ideals of a finite poset $P$, then this reduces to ordinary rowmotion on the order ideals of $P$.
The weak order (a.k.a. permutohedral order) on the permutations in $S_n$ is a semidistributive lattice. In this way, we obtain an action of rowmotion on the set of permutations in $S_n$.
Note that the dynamics of weak order rowmotion is poorly understood. A collection of nontrivial homomesies is described in Corollary 6.14 of [4].
This map is the composite of Mp00241invert Laguerre heap and Mp00064reverse.
Conjecturally, it is also the rowmotion on the weak order:
Any semidistributive lattice $L$ has a canonical labeling of the edges of its Hasse diagram by its join irreducible elements (see [1] and [2]). Rowmotion on this lattice is the bijection which takes an element $x \in L$ with a given set of down-labels to the unique element $y \in L$ which has that set as its up-labels (see [2] and [3]). For example, if the lattice is the distributive lattice $J(P)$ of order ideals of a finite poset $P$, then this reduces to ordinary rowmotion on the order ideals of $P$.
The weak order (a.k.a. permutohedral order) on the permutations in $S_n$ is a semidistributive lattice. In this way, we obtain an action of rowmotion on the set of permutations in $S_n$.
Note that the dynamics of weak order rowmotion is poorly understood. A collection of nontrivial homomesies is described in Corollary 6.14 of [4].
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!