Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001671: Permutations ⟶ ℤ
Values
[1] => [1,0] => [1,0] => [2,1] => 1
[2] => [1,0,1,0] => [1,1,0,0] => [2,3,1] => 3
[1,1] => [1,1,0,0] => [1,0,1,0] => [3,1,2] => 2
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [2,3,4,1] => 6
[2,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,4,1,3] => 4
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => [4,1,2,3] => 3
[4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 10
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 7
[2,2] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => [4,3,1,2] => 5
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 5
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 4
[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] => 15
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => 11
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 8
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [2,3,6,1,4,5] => 8
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 6
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [2,6,1,3,4,5] => 6
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 5
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 12
[3,3] => [1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 9
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [2,6,4,1,3,5] => 9
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => [5,4,1,2,3] => 7
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [6,3,1,2,4,5] => 7
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 13
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [6,3,4,1,2,5] => 10
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [2,6,5,1,3,4] => 10
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => 8
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 14
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [6,3,5,1,2,4] => 11
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 8
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [6,5,4,1,2,3] => 12
[] => [] => [] => [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
Haglund's hag of a permutation.
Let $edif$ be the sum of the differences of exceedence tops and bottoms, let $\pi_E$ the subsequence of exceedence tops and let $\pi_N$ be the subsequence of non-exceedence tops. Finally, let $L$ be the number of pairs of indices $k < i$ such that $\pi_k \leq i < \pi_i$.
Then $hag(\pi) = edif + inv(\pi_E) - inv(\pi_N) + L$, where $inv$ denotes the number of inversions of a word.
Let $edif$ be the sum of the differences of exceedence tops and bottoms, let $\pi_E$ the subsequence of exceedence tops and let $\pi_N$ be the subsequence of non-exceedence tops. Finally, let $L$ be the number of pairs of indices $k < i$ such that $\pi_k \leq i < \pi_i$.
Then $hag(\pi) = edif + inv(\pi_E) - inv(\pi_N) + L$, where $inv$ denotes the number of inversions of a word.
Map
Delest-Viennot-inverse
Description
Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
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.
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!