Identifier
-
Mp00129:
Dyck paths
—to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶
Permutations
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000056: Permutations ⟶ ℤ (values match St000234The number of global ascents of a permutation.)
Values
[1,0] => [1] => [1] => [1] => 1
[1,0,1,0] => [2,1] => [2,1] => [1,2] => 2
[1,1,0,0] => [1,2] => [1,2] => [1,2] => 2
[1,0,1,0,1,0] => [2,3,1] => [3,2,1] => [1,3,2] => 2
[1,0,1,1,0,0] => [2,1,3] => [2,1,3] => [1,2,3] => 3
[1,1,0,0,1,0] => [1,3,2] => [1,3,2] => [1,2,3] => 3
[1,1,0,1,0,0] => [3,1,2] => [2,3,1] => [1,2,3] => 3
[1,1,1,0,0,0] => [1,2,3] => [1,2,3] => [1,2,3] => 3
[1,0,1,0,1,0,1,0] => [2,3,4,1] => [4,2,3,1] => [1,4,2,3] => 2
[1,0,1,0,1,1,0,0] => [2,3,1,4] => [3,2,1,4] => [1,3,2,4] => 3
[1,0,1,1,0,0,1,0] => [2,1,4,3] => [2,1,4,3] => [1,2,3,4] => 4
[1,0,1,1,0,1,0,0] => [2,4,1,3] => [3,2,4,1] => [1,3,4,2] => 2
[1,0,1,1,1,0,0,0] => [2,1,3,4] => [2,1,3,4] => [1,2,3,4] => 4
[1,1,0,0,1,0,1,0] => [1,3,4,2] => [1,4,3,2] => [1,2,4,3] => 3
[1,1,0,0,1,1,0,0] => [1,3,2,4] => [1,3,2,4] => [1,2,3,4] => 4
[1,1,0,1,0,0,1,0] => [3,1,4,2] => [3,4,1,2] => [1,3,2,4] => 3
[1,1,0,1,0,1,0,0] => [3,4,1,2] => [2,4,3,1] => [1,2,4,3] => 3
[1,1,0,1,1,0,0,0] => [3,1,2,4] => [2,3,1,4] => [1,2,3,4] => 4
[1,1,1,0,0,0,1,0] => [1,2,4,3] => [1,2,4,3] => [1,2,3,4] => 4
[1,1,1,0,0,1,0,0] => [1,4,2,3] => [1,3,4,2] => [1,2,3,4] => 4
[1,1,1,0,1,0,0,0] => [4,1,2,3] => [2,3,4,1] => [1,2,3,4] => 4
[1,1,1,1,0,0,0,0] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,0,1,0,1,0,1,0] => [2,3,4,5,1] => [5,2,3,4,1] => [1,5,2,3,4] => 2
[1,0,1,0,1,0,1,1,0,0] => [2,3,4,1,5] => [4,2,3,1,5] => [1,4,2,3,5] => 3
[1,0,1,0,1,1,0,0,1,0] => [2,3,1,5,4] => [3,2,1,5,4] => [1,3,2,4,5] => 4
[1,0,1,0,1,1,0,1,0,0] => [2,3,5,1,4] => [4,2,3,5,1] => [1,4,5,2,3] => 2
[1,0,1,0,1,1,1,0,0,0] => [2,3,1,4,5] => [3,2,1,4,5] => [1,3,2,4,5] => 4
[1,0,1,1,0,0,1,0,1,0] => [2,1,4,5,3] => [2,1,5,4,3] => [1,2,3,5,4] => 4
[1,0,1,1,0,0,1,1,0,0] => [2,1,4,3,5] => [2,1,4,3,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,0,1,0] => [2,4,1,5,3] => [4,2,5,1,3] => [1,4,2,3,5] => 3
[1,0,1,1,0,1,0,1,0,0] => [2,4,5,1,3] => [3,2,5,4,1] => [1,3,5,2,4] => 2
[1,0,1,1,0,1,1,0,0,0] => [2,4,1,3,5] => [3,2,4,1,5] => [1,3,4,2,5] => 3
[1,0,1,1,1,0,0,0,1,0] => [2,1,3,5,4] => [2,1,3,5,4] => [1,2,3,4,5] => 5
[1,0,1,1,1,0,0,1,0,0] => [2,1,5,3,4] => [2,1,4,5,3] => [1,2,3,4,5] => 5
[1,0,1,1,1,0,1,0,0,0] => [2,5,1,3,4] => [3,2,4,5,1] => [1,3,4,5,2] => 2
[1,0,1,1,1,1,0,0,0,0] => [2,1,3,4,5] => [2,1,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,0,1,0,1,0] => [1,3,4,5,2] => [1,5,3,4,2] => [1,2,5,3,4] => 3
[1,1,0,0,1,0,1,1,0,0] => [1,3,4,2,5] => [1,4,3,2,5] => [1,2,4,3,5] => 4
[1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4] => [1,3,2,5,4] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,1,0,0] => [1,3,5,2,4] => [1,4,3,5,2] => [1,2,4,5,3] => 3
[1,1,0,0,1,1,1,0,0,0] => [1,3,2,4,5] => [1,3,2,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,0,1,0,1,0] => [3,1,4,5,2] => [3,5,1,4,2] => [1,3,2,5,4] => 3
[1,1,0,1,0,0,1,1,0,0] => [3,1,4,2,5] => [3,4,1,2,5] => [1,3,2,4,5] => 4
[1,1,0,1,0,1,0,0,1,0] => [3,4,1,5,2] => [4,5,3,1,2] => [1,4,2,5,3] => 2
[1,1,0,1,0,1,0,1,0,0] => [3,4,5,1,2] => [2,5,3,4,1] => [1,2,5,3,4] => 3
[1,1,0,1,0,1,1,0,0,0] => [3,4,1,2,5] => [2,4,3,1,5] => [1,2,4,3,5] => 4
[1,1,0,1,1,0,0,0,1,0] => [3,1,2,5,4] => [2,3,1,5,4] => [1,2,3,4,5] => 5
[1,1,0,1,1,0,0,1,0,0] => [3,1,5,2,4] => [3,4,1,5,2] => [1,3,2,4,5] => 4
[1,1,0,1,1,0,1,0,0,0] => [3,5,1,2,4] => [2,4,3,5,1] => [1,2,4,5,3] => 3
[1,1,0,1,1,1,0,0,0,0] => [3,1,2,4,5] => [2,3,1,4,5] => [1,2,3,4,5] => 5
[1,1,1,0,0,0,1,0,1,0] => [1,2,4,5,3] => [1,2,5,4,3] => [1,2,3,5,4] => 4
[1,1,1,0,0,0,1,1,0,0] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,3,4,5] => 5
[1,1,1,0,0,1,0,0,1,0] => [1,4,2,5,3] => [1,4,5,2,3] => [1,2,4,3,5] => 4
[1,1,1,0,0,1,0,1,0,0] => [1,4,5,2,3] => [1,3,5,4,2] => [1,2,3,5,4] => 4
[1,1,1,0,0,1,1,0,0,0] => [1,4,2,3,5] => [1,3,4,2,5] => [1,2,3,4,5] => 5
[1,1,1,0,1,0,0,0,1,0] => [4,1,2,5,3] => [2,4,5,1,3] => [1,2,4,3,5] => 4
[1,1,1,0,1,0,0,1,0,0] => [4,1,5,2,3] => [4,3,5,1,2] => [1,4,2,3,5] => 3
[1,1,1,0,1,0,1,0,0,0] => [4,5,1,2,3] => [2,3,5,4,1] => [1,2,3,5,4] => 4
[1,1,1,0,1,1,0,0,0,0] => [4,1,2,3,5] => [2,3,4,1,5] => [1,2,3,4,5] => 5
[1,1,1,1,0,0,0,0,1,0] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,4,5] => 5
[1,1,1,1,0,0,0,1,0,0] => [1,2,5,3,4] => [1,2,4,5,3] => [1,2,3,4,5] => 5
[1,1,1,1,0,0,1,0,0,0] => [1,5,2,3,4] => [1,3,4,5,2] => [1,2,3,4,5] => 5
[1,1,1,1,0,1,0,0,0,0] => [5,1,2,3,4] => [2,3,4,5,1] => [1,2,3,4,5] => 5
[1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,0,1,0,1,0] => [2,3,4,5,6,1] => [6,2,3,4,5,1] => [1,6,2,3,4,5] => 2
[1,0,1,0,1,0,1,0,1,1,0,0] => [2,3,4,5,1,6] => [5,2,3,4,1,6] => [1,5,2,3,4,6] => 3
[1,0,1,0,1,0,1,1,0,0,1,0] => [2,3,4,1,6,5] => [4,2,3,1,6,5] => [1,4,2,3,5,6] => 4
[1,0,1,0,1,0,1,1,0,1,0,0] => [2,3,4,6,1,5] => [5,2,3,4,6,1] => [1,5,6,2,3,4] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [2,3,4,1,5,6] => [4,2,3,1,5,6] => [1,4,2,3,5,6] => 4
[1,0,1,0,1,1,0,0,1,0,1,0] => [2,3,1,5,6,4] => [3,2,1,6,5,4] => [1,3,2,4,6,5] => 4
[1,0,1,0,1,1,0,0,1,1,0,0] => [2,3,1,5,4,6] => [3,2,1,5,4,6] => [1,3,2,4,5,6] => 5
[1,0,1,0,1,1,0,1,0,0,1,0] => [2,3,5,1,6,4] => [5,2,3,6,1,4] => [1,5,2,3,4,6] => 3
[1,0,1,0,1,1,0,1,0,1,0,0] => [2,3,5,6,1,4] => [4,2,3,6,5,1] => [1,4,6,2,3,5] => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => [2,3,5,1,4,6] => [4,2,3,5,1,6] => [1,4,5,2,3,6] => 3
[1,0,1,0,1,1,1,0,0,0,1,0] => [2,3,1,4,6,5] => [3,2,1,4,6,5] => [1,3,2,4,5,6] => 5
[1,0,1,0,1,1,1,0,0,1,0,0] => [2,3,1,6,4,5] => [3,2,1,5,6,4] => [1,3,2,4,5,6] => 5
[1,0,1,0,1,1,1,0,1,0,0,0] => [2,3,6,1,4,5] => [4,2,3,5,6,1] => [1,4,5,6,2,3] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [2,3,1,4,5,6] => [3,2,1,4,5,6] => [1,3,2,4,5,6] => 5
[1,0,1,1,0,0,1,0,1,0,1,0] => [2,1,4,5,6,3] => [2,1,6,4,5,3] => [1,2,3,6,4,5] => 4
[1,0,1,1,0,0,1,0,1,1,0,0] => [2,1,4,5,3,6] => [2,1,5,4,3,6] => [1,2,3,5,4,6] => 5
[1,0,1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,6,5] => [2,1,4,3,6,5] => [1,2,3,4,5,6] => 6
[1,0,1,1,0,0,1,1,0,1,0,0] => [2,1,4,6,3,5] => [2,1,5,4,6,3] => [1,2,3,5,6,4] => 4
[1,0,1,1,0,0,1,1,1,0,0,0] => [2,1,4,3,5,6] => [2,1,4,3,5,6] => [1,2,3,4,5,6] => 6
[1,0,1,1,0,1,0,0,1,0,1,0] => [2,4,1,5,6,3] => [4,2,6,1,5,3] => [1,4,2,3,6,5] => 3
[1,0,1,1,0,1,0,0,1,1,0,0] => [2,4,1,5,3,6] => [4,2,5,1,3,6] => [1,4,2,3,5,6] => 4
[1,0,1,1,0,1,0,1,0,0,1,0] => [2,4,5,1,6,3] => [5,2,6,4,1,3] => [1,5,2,3,6,4] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [2,4,5,6,1,3] => [3,2,6,4,5,1] => [1,3,6,2,4,5] => 2
[1,0,1,1,0,1,0,1,1,0,0,0] => [2,4,5,1,3,6] => [3,2,5,4,1,6] => [1,3,5,2,4,6] => 3
[1,0,1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,6,5] => [3,2,4,1,6,5] => [1,3,4,2,5,6] => 4
[1,0,1,1,0,1,1,0,0,1,0,0] => [2,4,1,6,3,5] => [4,2,5,1,6,3] => [1,4,2,3,5,6] => 4
[1,0,1,1,0,1,1,0,1,0,0,0] => [2,4,6,1,3,5] => [3,2,5,4,6,1] => [1,3,5,6,2,4] => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [2,4,1,3,5,6] => [3,2,4,1,5,6] => [1,3,4,2,5,6] => 4
[1,0,1,1,1,0,0,0,1,0,1,0] => [2,1,3,5,6,4] => [2,1,3,6,5,4] => [1,2,3,4,6,5] => 5
[1,0,1,1,1,0,0,0,1,1,0,0] => [2,1,3,5,4,6] => [2,1,3,5,4,6] => [1,2,3,4,5,6] => 6
[1,0,1,1,1,0,0,1,0,0,1,0] => [2,1,5,3,6,4] => [2,1,5,6,3,4] => [1,2,3,5,4,6] => 5
[1,0,1,1,1,0,0,1,0,1,0,0] => [2,1,5,6,3,4] => [2,1,4,6,5,3] => [1,2,3,4,6,5] => 5
[1,0,1,1,1,0,0,1,1,0,0,0] => [2,1,5,3,4,6] => [2,1,4,5,3,6] => [1,2,3,4,5,6] => 6
[1,0,1,1,1,0,1,0,0,0,1,0] => [2,5,1,3,6,4] => [3,2,5,6,1,4] => [1,3,5,2,4,6] => 3
[1,0,1,1,1,0,1,0,0,1,0,0] => [2,5,1,6,3,4] => [5,2,4,6,1,3] => [1,5,2,3,4,6] => 3
[1,0,1,1,1,0,1,0,1,0,0,0] => [2,5,6,1,3,4] => [3,2,4,6,5,1] => [1,3,4,6,2,5] => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => [2,5,1,3,4,6] => [3,2,4,5,1,6] => [1,3,4,5,2,6] => 3
>>> 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 decomposition (or block) number of a permutation.
For $\pi \in \mathcal{S}_n$, this is given by
$$\#\big\{ 1 \leq k \leq n : \{\pi_1,\ldots,\pi_k\} = \{1,\ldots,k\} \big\}.$$
This is also known as the number of connected components [1] or the number of blocks [2] of the permutation, considering it as a direct sum.
This is one plus St000234The number of global ascents of a permutation..
For $\pi \in \mathcal{S}_n$, this is given by
$$\#\big\{ 1 \leq k \leq n : \{\pi_1,\ldots,\pi_k\} = \{1,\ldots,k\} \big\}.$$
This is also known as the number of connected components [1] or the number of blocks [2] of the permutation, considering it as a direct sum.
This is one plus St000234The number of global ascents of a permutation..
Map
to 321-avoiding permutation (Billey-Jockusch-Stanley)
Description
The Billey-Jockusch-Stanley bijection to 321-avoiding permutations.
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
first fundamental transformation
Description
Return the permutation whose cycles are the subsequences between successive left to right maxima.
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!