Identifier
-
Mp00099:
Dyck paths
—bounce path⟶
Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001090: Permutations ⟶ ℤ
Values
[1,0] => [1,0] => [2,1] => 1
[1,0,1,0] => [1,0,1,0] => [3,1,2] => 2
[1,1,0,0] => [1,1,0,0] => [2,3,1] => 2
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [4,1,2,3] => 3
[1,0,1,1,0,0] => [1,0,1,1,0,0] => [3,1,4,2] => 2
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [3,1,4,2] => 2
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [2,3,4,1] => 3
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 4
[1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 3
[1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 2
[1,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 3
[1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 3
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 2
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 3
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 3
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 3
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 4
[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [5,1,2,3,6,4] => 4
[1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [4,1,2,6,3,5] => 3
[1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [5,1,2,3,6,4] => 4
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 3
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [4,1,2,6,3,5] => 3
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => 3
[1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 3
[1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => 3
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 4
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [2,6,1,3,4,5] => 4
[1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [2,5,1,3,6,4] => 3
[1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [2,5,1,3,6,4] => 3
[1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 3
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 3
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 3
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 3
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 3
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 4
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [2,3,6,1,4,5] => 3
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 3
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 3
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 3
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 3
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 3
[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] => 3
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 4
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => 4
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 3
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 4
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 5
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [7,1,2,3,4,5,6] => 6
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [6,1,2,3,4,7,5] => 5
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,1,2,3,7,4,6] => 4
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [6,1,2,3,4,7,5] => 5
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [5,1,2,3,6,7,4] => 4
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,1,2,3,7,4,6] => 4
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [5,1,2,3,6,7,4] => 4
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [5,1,2,3,6,7,4] => 4
[1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,7,1,3,4,5,6] => 5
[1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [2,3,4,7,1,5,6] => 4
[1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [2,3,4,6,1,7,5] => 4
[1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [2,3,4,6,1,7,5] => 4
[1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [2,3,4,6,1,7,5] => 4
[1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [2,3,4,6,1,7,5] => 4
[1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [2,3,4,5,7,1,6] => 5
[1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [2,3,4,6,1,7,5] => 4
[1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 6
[1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [8,1,2,3,4,5,6,7] => 7
[1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [7,1,2,3,4,5,8,6] => 6
[1,0,1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [7,1,2,3,4,5,8,6] => 6
[1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,0,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,0,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,0,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,0,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,1,0,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,0,1,1,1,0,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [2,8,1,3,4,5,6,7] => 6
[1,1,0,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,1,0,1,0,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,1,0,1,0,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,1,0,1,0,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
[1,1,0,1,1,0,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 2
>>> Load all 119 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 pop-stack-sorts needed to sort a permutation.
The pop-stack sorting operator is defined as follows. Process the permutation $\pi$ from left to right. If the stack is empty or its top element is smaller than the current element, empty the stack completely and append its elements to the output in reverse order. Next, push the current element onto the stack. After having processed the last entry, append the stack to the output in reverse order.
A permutation is $t$-pop-stack sortable if it is sortable using $t$ pop-stacks in series.
The pop-stack sorting operator is defined as follows. Process the permutation $\pi$ from left to right. If the stack is empty or its top element is smaller than the current element, empty the stack completely and append its elements to the output in reverse order. Next, push the current element onto the stack. After having processed the last entry, append the stack to the output in reverse order.
A permutation is $t$-pop-stack sortable if it is sortable using $t$ pop-stacks in series.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
bounce path
Description
Sends a Dyck path $D$ of length $2n$ to its bounce path.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.
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!