Identifier
-
Mp00007:
Alternating sign matrices
—to Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001569: Permutations ⟶ ℤ
Values
[[1]] => [1,0] => [1,1,0,0] => [1,2] => 0
[[1,0],[0,1]] => [1,0,1,0] => [1,1,0,1,0,0] => [1,3,2] => 1
[[0,1],[1,0]] => [1,1,0,0] => [1,1,1,0,0,0] => [1,2,3] => 0
[[1,0,0],[0,1,0],[0,0,1]] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,3,2,4] => 1
[[0,1,0],[1,0,0],[0,0,1]] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,4,2,3] => 2
[[1,0,0],[0,0,1],[0,1,0]] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,3,4,2] => 2
[[0,1,0],[1,-1,1],[0,1,0]] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,2,4,3] => 1
[[0,0,1],[1,0,0],[0,1,0]] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 0
[[0,1,0],[0,0,1],[1,0,0]] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,2,4,3] => 1
[[0,0,1],[0,1,0],[1,0,0]] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 0
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,3,2,5,4] => 1
[[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,4,2,5,3] => 2
[[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,3,2,4,5] => 1
[[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,4,2,3,5] => 2
[[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,5,2,3,4] => 2
[[0,1,0,0],[0,0,1,0],[1,0,0,0],[0,0,0,1]] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,4,2,3,5] => 2
[[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,5,2,3,4] => 2
[[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4] => 2
[[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,4,5,2,3] => 2
[[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,3,4,2,5] => 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 1
[[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,2,5,3,4] => 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 1
[[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,2,5,3,4] => 2
[[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,3,4,5,2] => 2
[[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,2,4,5,3] => 2
[[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[[0,1,0,0],[0,0,0,1],[1,0,0,0],[0,0,1,0]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,2,4,5,3] => 2
[[0,0,1,0],[0,1,-1,1],[1,0,0,0],[0,0,1,0]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[[0,0,0,1],[0,1,0,0],[1,0,0,0],[0,0,1,0]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[[1,0,0,0],[0,0,1,0],[0,0,0,1],[0,1,0,0]] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,3,4,2,5] => 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 1
[[0,0,1,0],[1,0,0,0],[0,0,0,1],[0,1,0,0]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,2,5,3,4] => 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 1
[[0,0,1,0],[0,1,0,0],[1,-1,0,1],[0,1,0,0]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,2,5,3,4] => 2
[[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,3,4,5,2] => 2
[[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,2,4,5,3] => 2
[[0,0,1,0],[1,0,-1,1],[0,0,1,0],[0,1,0,0]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[[0,0,0,1],[1,0,0,0],[0,0,1,0],[0,1,0,0]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[[0,1,0,0],[0,0,0,1],[1,-1,1,0],[0,1,0,0]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,2,4,5,3] => 2
[[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[[0,0,0,1],[0,1,0,0],[1,-1,1,0],[0,1,0,0]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[[0,0,1,0],[0,0,0,1],[1,0,0,0],[0,1,0,0]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[[0,0,0,1],[0,0,1,0],[1,0,0,0],[0,1,0,0]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 1
[[0,0,1,0],[0,1,0,0],[0,0,0,1],[1,0,0,0]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,2,5,3,4] => 2
[[0,1,0,0],[0,0,0,1],[0,0,1,0],[1,0,0,0]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,2,4,5,3] => 2
[[0,0,1,0],[0,1,-1,1],[0,0,1,0],[1,0,0,0]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[[0,0,0,1],[0,1,0,0],[0,0,1,0],[1,0,0,0]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[[0,0,1,0],[0,0,0,1],[0,1,0,0],[1,0,0,0]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
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 modular displacement of a permutation.
This is $\max_{1\leq i \leq n} \left(\min(\pi(i)-i\pmod n, i-\pi(i)\pmod n)\right)$ for a permutation $\pi$ of $\{1,\dots,n\}$.
This is $\max_{1\leq i \leq n} \left(\min(\pi(i)-i\pmod n, i-\pi(i)\pmod n)\right)$ for a permutation $\pi$ of $\{1,\dots,n\}$.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
to Dyck path
Description
The Dyck path determined by the last diagonal of the monotone triangle of an alternating sign matrix.
Map
to 321-avoiding permutation
Description
Sends a Dyck path to a 321-avoiding permutation.
This bijection defined in [3, pp. 60] and in [2, Section 3.1].
It is shown in [1] that it sends the number of centered tunnels to the number of fixed points, the number of right tunnels to the number of exceedences, and the semilength plus the height of the middle point to 2 times the length of the longest increasing subsequence.
This bijection defined in [3, pp. 60] and in [2, Section 3.1].
It is shown in [1] that it sends the number of centered tunnels to the number of fixed points, the number of right tunnels to the number of exceedences, and the semilength plus the height of the middle point to 2 times the length of the longest increasing subsequence.
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!