Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000246: Permutations ⟶ ℤ (values match St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order.)
Values
[1] => [1,0,1,0] => [1,1,0,0] => [1,2] => 1
[2] => [1,1,0,0,1,0] => [1,1,0,1,0,0] => [2,1,3] => 2
[1,1] => [1,0,1,1,0,0] => [1,0,1,1,0,0] => [2,3,1] => 1
[3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,0,1,0,0] => [3,2,4,1] => 2
[2,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,2,3] => 3
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => [3,4,2,1] => 1
[4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => [4,3,5,2,1] => 2
[3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,1,2,4] => 4
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => [3,2,1,4] => 3
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [3,4,1,2] => 2
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [4,5,3,2,1] => 1
[5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => [5,4,6,3,2,1] => 2
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => [4,3,5,1,2] => 3
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,0] => [2,1,3,4] => 5
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [2,3,1,4] => 4
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => [2,3,4,1] => 3
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => 2
[1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [5,6,4,3,2,1] => 1
[5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [5,4,6,3,1,2] => 3
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [4,2,3,1,5] => 5
[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0] => [4,2,3,5,1] => 4
[3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [4,3,2,1,5] => 4
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 6
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [4,5,2,1,3] => 3
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [4,3,2,5,1] => 3
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => [4,5,2,3,1] => 2
[2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [5,6,4,3,1,2] => 2
[7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0] => [7,6,8,5,4,3,2,1] => 2
[5,2] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [5,4,6,2,1,3] => 4
[5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => [5,4,6,2,3,1] => 3
[4,3] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,1,0,0,0] => [3,2,4,5,1] => 5
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,3,5] => 7
[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [3,4,2,5,1] => 4
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => [4,2,1,3,5] => 6
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0] => [4,3,1,2,5] => 5
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => 4
[3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => [5,6,4,2,1,3] => 3
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [3,4,5,2,1] => 3
[2,2,1,1,1] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [5,6,4,2,3,1] => 2
[5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => [5,3,4,2,6,1] => 5
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => [5,4,6,1,2,3] => 5
[5,1,1,1] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,1,0,0] => [5,3,4,6,2,1] => 4
[4,4] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => [5,4,3,2,6,1] => 4
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => [3,1,2,4,5] => 8
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => [3,2,1,4,5] => 7
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [3,4,1,2,5] => 6
[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => [5,6,3,2,4,1] => 3
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [3,2,4,1,5] => 6
[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [3,4,2,1,5] => 5
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => 4
[3,2,1,1,1] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [5,6,4,1,2,3] => 4
[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => [5,4,3,6,2,1] => 3
[2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [5,6,3,4,2,1] => 2
[2,1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0] => [7,8,6,5,4,3,1,2] => 2
[7,2] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,0,1,1,0,1,0,0] => [7,6,8,5,4,2,1,3] => 4
[5,4] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => [4,3,5,6,2,1] => 5
[5,3,1] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [5,3,4,1,2,6] => 7
[5,2,2] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [5,3,4,2,1,6] => 6
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [5,3,4,6,1,2] => 5
[5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => [4,5,3,6,2,1] => 4
[4,4,1] => [1,1,1,0,1,0,0,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [5,4,3,1,2,6] => 6
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,0,0,0,0] => [2,1,3,4,5] => 9
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [2,3,1,4,5] => 8
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [2,3,4,1,5] => 7
[4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [5,6,3,1,2,4] => 5
[3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [5,4,3,2,1,6] => 5
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 6
[3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [5,6,3,2,1,4] => 4
[3,2,2,2] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [5,4,3,6,1,2] => 4
[3,2,2,1,1] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [5,6,3,4,1,2] => 3
[2,2,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [4,5,6,3,2,1] => 3
[2,2,1,1,1,1,1] => [1,0,1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [7,8,6,5,4,2,3,1] => 2
[6,2,1,1] => [1,1,1,0,1,1,0,1,0,0,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,1,0,0] => [6,5,7,3,4,1,2] => 4
[5,4,1] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [4,3,5,6,1,2] => 6
[5,3,2] => [1,1,1,0,0,1,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [5,2,3,1,4,6] => 9
[5,3,1,1] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [5,2,3,4,1,6] => 8
[5,2,2,1] => [1,1,0,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => [5,2,3,4,6,1] => 7
[5,2,1,1,1] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [4,5,3,6,1,2] => 5
[4,4,2] => [1,1,1,0,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [5,3,2,1,4,6] => 8
[4,4,1,1] => [1,1,0,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [5,3,2,4,1,6] => 7
[4,3,3] => [1,1,1,0,0,0,1,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [5,4,2,1,3,6] => 7
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 10
[4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,1,0,0] => [5,6,2,1,3,4] => 6
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [5,4,2,3,1,6] => 6
[4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [5,6,2,3,1,4] => 5
[3,3,3,1] => [1,1,0,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,1,0,0,1,0,0] => [5,3,2,4,6,1] => 6
[3,3,2,2] => [1,1,0,0,1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,1,0,0] => [5,4,2,3,6,1] => 5
[3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [5,6,2,3,4,1] => 4
[3,2,2,2,1] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [4,5,6,3,1,2] => 4
[2,2,2,1,1,1,1] => [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [7,8,6,5,3,4,2,1] => 2
[5,4,2] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [4,2,3,5,1,6] => 9
[5,4,1,1] => [1,1,0,1,1,0,0,0,1,0,1,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => [4,2,3,5,6,1] => 8
[5,3,3] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [4,3,2,5,1,6] => 8
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [5,1,2,3,4,6] => 11
[5,3,1,1,1] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [4,5,2,3,1,6] => 7
[5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => [4,3,2,5,6,1] => 7
[5,2,2,1,1] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,1,0,0,0] => [4,5,2,3,6,1] => 6
[4,4,3] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [4,3,5,2,1,6] => 7
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [5,2,1,3,4,6] => 10
[4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [4,5,3,2,1,6] => 6
[4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [5,3,1,2,4,6] => 9
>>> Load all 245 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 non-inversions of a permutation.
For a permutation of $\{1,\ldots,n\}$, this is given by $\operatorname{noninv}(\pi) = \binom{n}{2}-\operatorname{inv}(\pi)$.
For a permutation of $\{1,\ldots,n\}$, this is given by $\operatorname{noninv}(\pi) = \binom{n}{2}-\operatorname{inv}(\pi)$.
Map
zeta map
Description
The zeta map on Dyck paths.
The zeta map $\zeta$ is a bijection on Dyck paths of semilength $n$.
It was defined in [1, Theorem 1], see also [2, Theorem 3.15] and sends the bistatistic (area, dinv) to the bistatistic (bounce, area). It is defined by sending a Dyck path $D$ with corresponding area sequence $a=(a_1,\ldots,a_n)$ to a Dyck path as follows:
The zeta map $\zeta$ is a bijection on Dyck paths of semilength $n$.
It was defined in [1, Theorem 1], see also [2, Theorem 3.15] and sends the bistatistic (area, dinv) to the bistatistic (bounce, area). It is defined by sending a Dyck path $D$ with corresponding area sequence $a=(a_1,\ldots,a_n)$ to a Dyck path as follows:
- First, build an intermediate Dyck path consisting of $d_1$ north steps, followed by $d_1$ east steps, followed by $d_2$ north steps and $d_2$ east steps, and so on, where $d_i$ is the number of $i-1$'s within the sequence $a$.
For example, given $a=(0,1,2,2,2,3,1,2)$, we build the path
$$NE\ NNEE\ NNNNEEEE\ NE.$$ - Next, the rectangles between two consecutive peaks are filled. Observe that such the rectangle between the $k$th and the $(k+1)$st peak must be filled by $d_k$ east steps and $d_{k+1}$ north steps. In the above example, the rectangle between the second and the third peak must be filled by $2$ east and $4$ north steps, the $2$ being the number of $1$'s in $a$, and $4$ being the number of $2$'s. To fill such a rectangle, scan through the sequence a from left to right, and add east or north steps whenever you see a $k-1$ or $k$, respectively. So to fill the $2\times 4$ rectangle, we look for $1$'s and $2$'s in the sequence and see $122212$, so this rectangle gets filled with $ENNNEN$.
The complete path we obtain in thus
$$NENNENNNENEEENEE.$$
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
to 132-avoiding permutation
Description
Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].
This bijection is defined in [1, Section 2].
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!