Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St001874: Permutations ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [1,2] => 0
[1,0,1,0] => [1,1,0,1,0,0] => [3,1,2] => 1
[1,1,0,0] => [1,1,1,0,0,0] => [1,2,3] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [3,4,1,2] => 2
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [3,1,2,4] => 1
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,4,2,3] => 1
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [4,1,2,3] => 1
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [3,4,5,1,2] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [3,4,1,2,5] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [3,1,5,2,4] => 2
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [3,5,1,2,4] => 2
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [3,1,2,4,5] => 1
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,4,5,2,3] => 2
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,4,2,3,5] => 1
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,1,5,2,3] => 2
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [4,5,1,2,3] => 2
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [4,1,2,3,5] => 1
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,2,5,3,4] => 1
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,5,2,3,4] => 1
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [5,1,2,3,4] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [3,4,5,6,1,2] => 2
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [3,4,5,1,2,6] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [3,4,1,6,2,5] => 3
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [3,4,6,1,2,5] => 3
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [3,4,1,2,5,6] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [3,1,5,6,2,4] => 3
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [3,1,5,2,4,6] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [3,5,1,6,2,4] => 3
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [3,5,6,1,2,4] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [3,5,1,2,4,6] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [3,1,2,6,4,5] => 2
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [3,1,6,2,4,5] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [3,6,1,2,4,5] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [3,1,2,4,5,6] => 1
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,4,5,6,2,3] => 2
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,4,5,2,3,6] => 2
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,4,2,6,3,5] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [1,4,6,2,3,5] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,4,2,3,5,6] => 1
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [4,1,5,6,2,3] => 3
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [4,1,5,2,3,6] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [4,5,1,6,2,3] => 3
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [4,5,6,1,2,3] => 3
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [4,5,1,2,3,6] => 2
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [4,1,2,6,3,5] => 2
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [4,1,6,2,3,5] => 2
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [4,6,1,2,3,5] => 2
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [4,1,2,3,5,6] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,2,5,6,3,4] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,2,5,3,4,6] => 1
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,5,2,6,3,4] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,5,6,2,3,4] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,5,2,3,4,6] => 1
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [5,1,2,6,3,4] => 2
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [5,1,6,2,3,4] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [5,6,1,2,3,4] => 2
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [5,1,2,3,4,6] => 1
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,2,3,6,4,5] => 1
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,2,6,3,4,5] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,6,2,3,4,5] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [6,1,2,3,4,5] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 0
[] => [1,0] => [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
Lusztig's a-function for the symmetric group.
Let $x$ be a permutation corresponding to the pair of tableaux $(P(x),Q(x))$
by the Robinson-Schensted correspondence and
$\operatorname{shape}(Q(x)')=( \lambda_1,...,\lambda_k)$
where $Q(x)'$ is the transposed tableau.
Then $a(x)=\sum\limits_{i=1}^{k}{\binom{\lambda_i}{2}}$.
See exercise 10 on page 198 in the book by Björner and Brenti "Combinatorics of Coxeter Groups" for equivalent characterisations and properties.
Let $x$ be a permutation corresponding to the pair of tableaux $(P(x),Q(x))$
by the Robinson-Schensted correspondence and
$\operatorname{shape}(Q(x)')=( \lambda_1,...,\lambda_k)$
where $Q(x)'$ is the transposed tableau.
Then $a(x)=\sum\limits_{i=1}^{k}{\binom{\lambda_i}{2}}$.
See exercise 10 on page 198 in the book by Björner and Brenti "Combinatorics of Coxeter Groups" for equivalent characterisations and properties.
Map
to 321-avoiding permutation (Billey-Jockusch-Stanley)
Description
The Billey-Jockusch-Stanley bijection to 321-avoiding permutations.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!