Identifier
-
Mp00099:
Dyck paths
—bounce path⟶
Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000882: Permutations ⟶ ℤ
Values
[1,0] => [1,0] => [1] => [1] => 1
[1,0,1,0] => [1,0,1,0] => [1,2] => [1,2] => 1
[1,1,0,0] => [1,1,0,0] => [2,1] => [1,2] => 1
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,2,3] => [1,2,3] => 1
[1,0,1,1,0,0] => [1,0,1,1,0,0] => [1,3,2] => [1,2,3] => 1
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [2,1,3] => [1,2,3] => 1
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,3,2] => [1,2,3] => 1
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [3,2,1] => [1,3,2] => 1
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => 1
[1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => [1,2,3,4] => 1
[1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => [1,2,3,4] => 1
[1,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => [1,2,3,4] => 1
[1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,2,4,3] => 1
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => [1,2,3,4] => 1
[1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => [1,2,3,4] => 1
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => [1,2,3,4] => 1
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => [1,2,3,4] => 1
[1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,2,4,3] => 1
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => [1,3,2,4] => 1
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => [1,2,3,4] => 1
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,2,4,3] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => [1,4,2,3] => 1
[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => 1
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [1,2,3,4,5] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [1,2,3,4,5] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [1,2,3,4,5] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [1,2,3,5,4] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [1,2,3,4,5] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,2,3,4,5] => 1
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [1,2,3,4,5] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,2,3,4,5] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [1,2,3,5,4] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [1,2,4,3,5] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,2,3,4,5] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [1,2,3,5,4] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,2,5,3,4] => 1
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [1,2,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [1,2,3,4,5] => 1
[1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [1,2,3,4,5] => 1
[1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [1,2,3,4,5] => 1
[1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [1,2,3,5,4] => 1
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [1,2,3,4,5] => 1
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,2,3,4,5] => 1
[1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [1,2,3,4,5] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,2,3,4,5] => 1
[1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [1,2,3,5,4] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [1,2,4,3,5] => 1
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,2,3,4,5] => 1
[1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [1,2,3,5,4] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,2,5,3,4] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [1,3,2,4,5] => 1
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [1,3,2,4,5] => 1
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [1,2,3,4,5] => 1
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [1,3,2,4,5] => 1
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [1,2,3,5,4] => 1
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [1,2,4,3,5] => 1
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [1,3,2,4,5] => 1
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [1,2,3,5,4] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,2,5,3,4] => 1
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [1,4,2,3,5] => 1
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [1,3,2,4,5] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [1,2,3,5,4] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,2,5,3,4] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [1,5,2,4,3] => 2
[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,2,3,4,5,6] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [1,2,3,5,4,6] => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [1,2,3,6,4,5] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [1,2,3,5,4,6] => 1
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,3,4,5,6] => 1
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [1,2,3,6,4,5] => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [1,2,4,3,5,6] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [1,2,4,3,5,6] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [1,2,3,4,5,6] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [1,2,4,3,5,6] => 1
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [1,2,3,5,4,6] => 1
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [1,2,4,3,5,6] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,2,3,4,6,5] => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [1,2,3,6,4,5] => 1
>>> Load all 196 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 connected components of short braid edges in the graph of braid moves of a permutation.
Given a permutation $\pi$, let $\operatorname{Red}(\pi)$ denote the set of reduced words for $\pi$ in terms of simple transpositions $s_i = (i,i+1)$. We now say that two reduced words are connected by a short braid move if they are obtained from each other by a modification of the form $s_i s_j \leftrightarrow s_j s_i$ for $|i-j| > 1$ as a consecutive subword of a reduced word.
For example, the two reduced words $s_1s_3s_2$ and $s_3s_1s_2$ for
$$(1243) = (12)(34)(23) = (34)(12)(23)$$
share an edge because they are obtained from each other by interchanging $s_1s_3 \leftrightarrow s_3s_1$.
This statistic counts the number connected components of such short braid moves among all reduced words.
Given a permutation $\pi$, let $\operatorname{Red}(\pi)$ denote the set of reduced words for $\pi$ in terms of simple transpositions $s_i = (i,i+1)$. We now say that two reduced words are connected by a short braid move if they are obtained from each other by a modification of the form $s_i s_j \leftrightarrow s_j s_i$ for $|i-j| > 1$ as a consecutive subword of a reduced word.
For example, the two reduced words $s_1s_3s_2$ and $s_3s_1s_2$ for
$$(1243) = (12)(34)(23) = (34)(12)(23)$$
share an edge because they are obtained from each other by interchanging $s_1s_3 \leftrightarrow s_3s_1$.
This statistic counts the number connected components of such short braid moves among all reduced words.
Map
cycle-as-one-line notation
Description
Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
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!