Identifier
Values
[1] => [1,0] => [1,0] => [1] => 1
[2] => [1,0,1,0] => [1,1,0,0] => [1,2] => 1
[1,1] => [1,1,0,0] => [1,0,1,0] => [2,1] => 1
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,2,3] => 1
[2,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [1,3,2] => 2
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => [2,3,1] => 1
[4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 1
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [1,2,4,3] => 3
[2,2] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => [3,1,2] => 1
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [1,3,4,2] => 3
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [2,3,4,1] => 1
[5] => [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] => 1
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [1,2,3,5,4] => 4
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [1,4,2,3] => 3
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [1,2,4,5,3] => 6
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [3,1,4,2] => 2
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [1,3,4,5,2] => 4
[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] => [2,3,4,5,1] => 1
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 1
[5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,2,3,4,6,5] => 5
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [1,2,5,3,4] => 6
[4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,2,3,5,6,4] => 10
[3,3] => [1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [4,1,2,3] => 1
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [1,4,2,5,3] => 8
[3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,2,4,5,6,3] => 10
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => [3,4,1,2] => 1
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [3,1,4,5,2] => 3
[2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,3,4,5,6,2] => 5
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [2,3,4,5,6,1] => 1
[7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7] => 1
[6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [1,2,3,4,5,7,6] => 6
[5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,2,3,6,4,5] => 10
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,5,2,3,4] => 4
[4,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,2,5,3,6,4] => 20
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [4,1,2,5,3] => 3
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [1,4,5,2,3] => 6
[3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,4,2,5,6,3] => 15
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [3,4,1,5,2] => 2
[2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [3,1,4,5,6,2] => 4
[1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [2,3,4,5,6,7,1] => 1
[5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,2,6,3,4,5] => 10
[5,2,1] => [1,0,1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0,1,0] => [1,2,3,6,4,7,5] => 40
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [5,1,2,3,4] => 1
[4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,5,2,3,6,4] => 15
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,2,5,6,3,4] => 20
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [4,1,5,2,3] => 3
[3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => [4,1,2,5,6,3] => 6
[3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => [1,4,5,2,6,3] => 15
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [3,4,5,1,2] => 1
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [3,4,1,5,6,2] => 3
[5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,6,2,3,4,5] => 5
[5,3,1] => [1,0,1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0,1,0] => [1,2,6,3,4,7,5] => 45
[4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => [5,1,2,3,6,4] => 4
[4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,5,2,6,3,4] => 20
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [4,5,1,2,3] => 1
[3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => [4,1,5,2,6,3] => 8
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,4,5,6,2,3] => 10
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [3,4,5,1,6,2] => 2
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [6,1,2,3,4,5] => 1
[5,4,1] => [1,0,1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0,1,0] => [1,6,2,3,4,7,5] => 24
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [5,1,2,6,3,4] => 6
[4,4,1,1] => [1,1,1,0,1,0,1,0,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0,1,0] => [5,1,2,3,6,7,4] => 10
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,5,6,2,3,4] => 10
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => [4,5,1,2,6,3] => 3
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [4,1,5,6,2,3] => 6
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [3,4,5,6,1,2] => 1
[6,5] => [1,0,1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [1,7,2,3,4,5,6] => 6
[5,5,1] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0,1,0] => [6,1,2,3,4,7,5] => 5
[5,4,2] => [1,0,1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,1,0,0] => [1,6,2,3,7,4,5] => 45
[4,4,3] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [5,1,6,2,3,4] => 4
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [4,5,1,6,2,3] => 3
[5,5,2] => [1,1,1,0,1,0,1,0,1,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [6,1,2,3,7,4,5] => 10
[5,4,3] => [1,0,1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,1,0,0,1,0,0,0] => [1,6,2,7,3,4,5] => 40
[4,4,4] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [5,6,1,2,3,4] => 1
[4,4,3,1] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0,1,0] => [5,1,6,2,3,7,4] => 15
[4,3,3,2] => [1,0,1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,1,0,0] => [1,5,6,2,7,3,4] => 45
[3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [4,5,6,1,2,3] => 1
[2,2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [3,4,5,6,7,1,2] => 1
[5,5,3] => [1,1,1,0,1,0,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,1,0,0,0] => [6,1,2,7,3,4,5] => 10
[5,4,4] => [1,0,1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [1,6,7,2,3,4,5] => 15
[4,4,4,1] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0,1,0] => [5,6,1,2,3,7,4] => 4
[4,3,3,3] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,1,0,0,0] => [1,5,6,7,2,3,4] => 20
[4,4,4,4] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [5,6,7,1,2,3,4] => 1
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
click to show known generating functions       
Description
The number of reduced Kogan faces with the permutation as type.
This is equivalent to finding the number of ways to represent the permutation $\pi \in S_{n+1}$ as a reduced subword of $s_n (s_{n-1} s_n) (s_{n-2} s_{n-1} s_n) \dotsm (s_1 \dotsm s_n)$, or the number of reduced pipe dreams for $\pi$.
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)$.
Map
to 321-avoiding permutation (Billey-Jockusch-Stanley)
Description
The Billey-Jockusch-Stanley bijection to 321-avoiding permutations.
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.