Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001745: Permutations ⟶ ℤ
Values
[1] => [1,0] => [1,0] => [2,1] => 0
[2] => [1,0,1,0] => [1,1,0,0] => [2,3,1] => 0
[1,1] => [1,1,0,0] => [1,0,1,0] => [3,1,2] => 0
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [2,3,4,1] => 0
[2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [4,3,1,2] => 0
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [3,1,4,2] => 1
[4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 0
[2,2] => [1,1,1,0,0,0] => [1,1,0,0,1,0] => [2,4,1,3] => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [4,3,1,5,2] => 1
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 2
[5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 0
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 1
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 0
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => [5,3,4,1,6,2] => 2
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 1
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => 2
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 3
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 0
[3,3] => [1,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 1
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0] => [2,6,5,1,3,4] => 1
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 0
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => 1
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [2,6,1,5,3,4] => 0
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 0
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [2,6,4,1,3,5] => 1
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 2
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,0,1,1,0,0] => [5,3,1,2,6,4] => 3
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 1
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => 0
[] => [] => [] => [1] => 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 number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation.
Let $\nu$ be a (partial) permutation of $[k]$ with $m$ letters together with dashes between some of its letters. An occurrence of $\nu$ in a permutation $\tau$ is a subsequence $\tau_{a_1},\dots,\tau_{a_m}$
such that $a_i + 1 = a_{i+1}$ whenever there is a dash between the $i$-th and the $(i+1)$-st letter of $\nu$, which is order isomorphic to $\nu$.
Thus, $\nu$ is a vincular pattern, except that it is not required to be a permutation.
An arrow pattern of size $k$ consists of such a generalized vincular pattern $\nu$ and arrows $b_1\to c_1, b_2\to c_2,\dots$, such that precisely the numbers $1,\dots,k$ appear in the vincular pattern and the arrows.
Let $\Phi$ be the map Mp00087inverse first fundamental transformation. Let $\tau$ be a permutation and $\sigma = \Phi(\tau)$. Then a subsequence $w = (x_{a_1},\dots,x_{a_m})$ of $\tau$ is an occurrence of the arrow pattern if $w$ is an occurrence of $\nu$, for each arrow $b\to c$ we have $\sigma(x_b) = x_c$ and $x_1 < x_2 < \dots < x_k$.
Let $\nu$ be a (partial) permutation of $[k]$ with $m$ letters together with dashes between some of its letters. An occurrence of $\nu$ in a permutation $\tau$ is a subsequence $\tau_{a_1},\dots,\tau_{a_m}$
such that $a_i + 1 = a_{i+1}$ whenever there is a dash between the $i$-th and the $(i+1)$-st letter of $\nu$, which is order isomorphic to $\nu$.
Thus, $\nu$ is a vincular pattern, except that it is not required to be a permutation.
An arrow pattern of size $k$ consists of such a generalized vincular pattern $\nu$ and arrows $b_1\to c_1, b_2\to c_2,\dots$, such that precisely the numbers $1,\dots,k$ appear in the vincular pattern and the arrows.
Let $\Phi$ be the map Mp00087inverse first fundamental transformation. Let $\tau$ be a permutation and $\sigma = \Phi(\tau)$. Then a subsequence $w = (x_{a_1},\dots,x_{a_m})$ of $\tau$ is an occurrence of the arrow pattern if $w$ is an occurrence of $\nu$, for each arrow $b\to c$ we have $\sigma(x_b) = x_c$ and $x_1 < x_2 < \dots < x_k$.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
Knuth-Krattenthaler
Description
The map that sends the Dyck path to a 321-avoiding permutation, then applies the Robinson-Schensted correspondence and finally interprets the first row of the insertion tableau and the second row of the recording tableau as up steps.
Interpreting a pair of two-row standard tableaux of the same shape as a Dyck path is explained by Knuth in [1, pp. 60].
Krattenthaler's bijection between Dyck paths and $321$-avoiding permutations used is Mp00119to 321-avoiding permutation (Krattenthaler), see [2].
This is the inverse of the map Mp00127left-to-right-maxima to Dyck path that interprets the left-to-right maxima of the permutation obtained from Mp00024to 321-avoiding permutation as a Dyck path.
Interpreting a pair of two-row standard tableaux of the same shape as a Dyck path is explained by Knuth in [1, pp. 60].
Krattenthaler's bijection between Dyck paths and $321$-avoiding permutations used is Mp00119to 321-avoiding permutation (Krattenthaler), see [2].
This is the inverse of the map Mp00127left-to-right-maxima to Dyck path that interprets the left-to-right maxima of the permutation obtained from Mp00024to 321-avoiding permutation as a Dyck path.
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!