Identifier
-
Mp00031:
Dyck paths
—to 312-avoiding permutation⟶
Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00277: Permutations —catalanization⟶ Permutations
St001729: Permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => [1] => 0
[1,0,1,0] => [1,2] => [2,1] => [2,1] => 1
[1,1,0,0] => [2,1] => [1,2] => [1,2] => 0
[1,0,1,0,1,0] => [1,2,3] => [3,2,1] => [3,2,1] => 1
[1,0,1,1,0,0] => [1,3,2] => [2,3,1] => [2,3,1] => 1
[1,1,0,0,1,0] => [2,1,3] => [3,1,2] => [2,3,1] => 1
[1,1,0,1,0,0] => [2,3,1] => [1,3,2] => [1,3,2] => 1
[1,1,1,0,0,0] => [3,2,1] => [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [4,3,2,1] => [4,3,2,1] => 2
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [3,4,2,1] => [3,4,2,1] => 2
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [4,2,3,1] => [3,4,2,1] => 2
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [2,4,3,1] => [2,4,3,1] => 1
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [2,3,4,1] => [2,3,4,1] => 1
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [4,3,1,2] => [3,4,2,1] => 2
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [3,4,1,2] => [4,3,2,1] => 2
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [4,1,3,2] => [2,4,3,1] => 1
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [1,4,3,2] => [1,4,3,2] => 1
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [1,3,4,2] => [1,3,4,2] => 1
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [4,1,2,3] => [2,3,4,1] => 1
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [1,4,2,3] => [1,3,4,2] => 1
[1,1,1,0,1,0,0,0] => [3,4,2,1] => [1,2,4,3] => [1,2,4,3] => 1
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [5,4,3,2,1] => [5,4,3,2,1] => 2
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [4,5,3,2,1] => [4,5,3,2,1] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [5,3,4,2,1] => [4,5,3,2,1] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [3,5,4,2,1] => [3,5,4,2,1] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [3,4,5,2,1] => [3,4,5,2,1] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [5,4,2,3,1] => [4,5,3,2,1] => 2
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [4,5,2,3,1] => [5,4,3,2,1] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [5,2,4,3,1] => [3,5,4,2,1] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [2,5,4,3,1] => [2,5,4,3,1] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [2,4,5,3,1] => [2,4,5,3,1] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [5,2,3,4,1] => [3,4,5,2,1] => 2
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [2,5,3,4,1] => [2,4,5,3,1] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,4,5,3,2] => [2,3,5,4,1] => [2,3,5,4,1] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [2,3,4,5,1] => [2,3,4,5,1] => 1
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [5,4,3,1,2] => [4,5,3,2,1] => 2
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [4,5,3,1,2] => [5,4,3,2,1] => 2
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [5,3,4,1,2] => [5,4,3,2,1] => 2
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [3,5,4,1,2] => [3,4,5,2,1] => 2
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [3,4,5,1,2] => [3,5,4,2,1] => 2
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [5,4,1,3,2] => [3,5,4,2,1] => 2
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [4,5,1,3,2] => [5,3,4,2,1] => 2
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [5,1,4,3,2] => [2,5,4,3,1] => 2
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [1,5,4,3,2] => [1,5,4,3,2] => 2
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [1,4,5,3,2] => [1,4,5,3,2] => 2
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [5,1,3,4,2] => [2,4,5,3,1] => 2
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [1,5,3,4,2] => [1,4,5,3,2] => 2
[1,1,0,1,1,0,1,0,0,0] => [2,4,5,3,1] => [1,3,5,4,2] => [1,3,5,4,2] => 1
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [1,3,4,5,2] => [1,3,4,5,2] => 1
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [5,4,1,2,3] => [3,4,5,2,1] => 2
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [4,5,1,2,3] => [4,3,5,2,1] => 2
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [5,1,4,2,3] => [2,4,5,3,1] => 2
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [1,5,4,2,3] => [1,4,5,3,2] => 2
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [1,4,5,2,3] => [1,5,4,3,2] => 2
[1,1,1,0,1,0,0,0,1,0] => [3,4,2,1,5] => [5,1,2,4,3] => [2,3,5,4,1] => 1
[1,1,1,0,1,0,0,1,0,0] => [3,4,2,5,1] => [1,5,2,4,3] => [1,3,5,4,2] => 1
[1,1,1,0,1,0,1,0,0,0] => [3,4,5,2,1] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,1,1,0,1,1,0,0,0,0] => [3,5,4,2,1] => [1,2,4,5,3] => [1,2,4,5,3] => 1
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [5,1,2,3,4] => [2,3,4,5,1] => 1
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [1,5,2,3,4] => [1,3,4,5,2] => 1
[1,1,1,1,0,0,1,0,0,0] => [4,3,5,2,1] => [1,2,5,3,4] => [1,2,4,5,3] => 1
[1,1,1,1,0,1,0,0,0,0] => [4,5,3,2,1] => [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [6,5,4,3,2,1] => [6,5,4,3,2,1] => 3
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [5,6,4,3,2,1] => [5,6,4,3,2,1] => 3
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [6,4,5,3,2,1] => [5,6,4,3,2,1] => 3
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [4,6,5,3,2,1] => [4,6,5,3,2,1] => 3
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [4,5,6,3,2,1] => [4,5,6,3,2,1] => 3
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [6,5,3,4,2,1] => [5,6,4,3,2,1] => 3
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [5,6,3,4,2,1] => [6,5,4,3,2,1] => 3
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [6,3,5,4,2,1] => [4,6,5,3,2,1] => 3
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [3,6,5,4,2,1] => [3,6,5,4,2,1] => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [3,5,6,4,2,1] => [3,5,6,4,2,1] => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [6,3,4,5,2,1] => [4,5,6,3,2,1] => 3
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [3,6,4,5,2,1] => [3,5,6,4,2,1] => 2
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,5,6,4,3] => [3,4,6,5,2,1] => [3,4,6,5,2,1] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [3,4,5,6,2,1] => [3,4,5,6,2,1] => 2
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [6,5,4,2,3,1] => [5,6,4,3,2,1] => 3
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [5,6,4,2,3,1] => [6,5,4,3,2,1] => 3
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [6,4,5,2,3,1] => [6,5,4,3,2,1] => 3
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [4,6,5,2,3,1] => [4,5,6,3,2,1] => 3
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [4,5,6,2,3,1] => [4,6,5,3,2,1] => 3
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [6,5,2,4,3,1] => [4,6,5,3,2,1] => 3
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [5,6,2,4,3,1] => [6,4,5,3,2,1] => 3
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [6,2,5,4,3,1] => [3,6,5,4,2,1] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [2,6,5,4,3,1] => [2,6,5,4,3,1] => 2
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [2,5,6,4,3,1] => [2,5,6,4,3,1] => 2
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [6,2,4,5,3,1] => [3,5,6,4,2,1] => 2
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [2,6,4,5,3,1] => [2,5,6,4,3,1] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,5,6,4,2] => [2,4,6,5,3,1] => [2,4,6,5,3,1] => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [2,4,5,6,3,1] => [2,4,5,6,3,1] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [6,5,2,3,4,1] => [4,5,6,3,2,1] => 3
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [5,6,2,3,4,1] => [5,4,6,3,2,1] => 3
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [6,2,5,3,4,1] => [3,5,6,4,2,1] => 2
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [2,6,5,3,4,1] => [2,5,6,4,3,1] => 2
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [2,5,6,3,4,1] => [2,6,5,4,3,1] => 2
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,4,5,3,2,6] => [6,2,3,5,4,1] => [3,4,6,5,2,1] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,4,5,3,6,2] => [2,6,3,5,4,1] => [2,4,6,5,3,1] => 2
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,4,5,6,3,2] => [2,3,6,5,4,1] => [2,3,6,5,4,1] => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,4,6,5,3,2] => [2,3,5,6,4,1] => [2,3,5,6,4,1] => 2
>>> Load all 274 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 visible descents of a permutation.
A visible descent of a permutation $\pi$ is a position $i$ such that $\pi(i+1) \leq \min(i, \pi(i))$.
A visible descent of a permutation $\pi$ is a position $i$ such that $\pi(i+1) \leq \min(i, \pi(i))$.
Map
reverse
Description
Sends a permutation to its reverse.
The reverse of a permutation $\sigma$ of length $n$ is given by $\tau$ with $\tau(i) = \sigma(n+1-i)$.
The reverse of a permutation $\sigma$ of length $n$ is given by $\tau$ with $\tau(i) = \sigma(n+1-i)$.
Map
to 312-avoiding permutation
Description
Map
catalanization
Description
The catalanization of a permutation.
For a permutation $\sigma$, this is the product of the reflections corresponding to the inversions of $\sigma$ in lex-order.
A permutation is $231$-avoiding if and only if it is a fixpoint of this map. Also, for every permutation there exists an index $k$ such that the $k$-fold application of this map is $231$-avoiding.
For a permutation $\sigma$, this is the product of the reflections corresponding to the inversions of $\sigma$ in lex-order.
A permutation is $231$-avoiding if and only if it is a fixpoint of this map. Also, for every permutation there exists an index $k$ such that the $k$-fold application of this map is $231$-avoiding.
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!