Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000019: Permutations ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [1,2] => 0
[1,0,1,0] => [1,1,0,1,0,0] => [3,1,2] => 2
[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] => 3
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [3,1,2,4] => 2
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,4,2,3] => 2
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [4,1,2,3] => 3
[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] => 4
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [3,4,1,2,5] => 3
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [3,1,5,2,4] => 4
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [3,5,1,2,4] => 4
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [3,1,2,4,5] => 2
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,4,5,2,3] => 3
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,4,2,3,5] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,1,5,2,3] => 4
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [4,5,1,2,3] => 4
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [4,1,2,3,5] => 3
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,2,5,3,4] => 2
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,5,2,3,4] => 3
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [5,1,2,3,4] => 4
[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] => 5
[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] => 4
[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] => 5
[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] => 5
[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] => 3
[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] => 5
[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] => 4
[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] => 5
[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] => 5
[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] => 4
[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] => 4
[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] => 5
[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] => 5
[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] => 2
[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] => 4
[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] => 3
[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] => 4
[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] => 4
[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] => 2
[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] => 5
[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] => 4
[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] => 5
[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] => 5
[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] => 4
[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] => 5
[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] => 5
[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] => 5
[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] => 3
[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] => 3
[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] => 2
[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] => 4
[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] => 4
[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] => 3
[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] => 5
[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] => 5
[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] => 5
[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] => 4
[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] => 2
[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] => 3
[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] => 4
[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] => 5
[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,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [3,4,5,6,7,1,2] => 6
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,1,1,1,0,0,0,0,0] => [3,4,1,2,5,6,7] => 3
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,1,0,0,0,0] => [3,5,6,1,2,4,7] => 5
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => [3,6,1,2,4,5,7] => 5
[1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [3,1,2,4,5,6,7] => 2
[1,1,0,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,1,0,0,0] => [1,4,6,7,2,3,5] => 5
[1,1,0,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,1,1,0,1,0,0,0,0] => [1,4,7,2,3,5,6] => 5
[1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,0,1,1,0,0,0] => [4,5,1,6,2,3,7] => 5
[1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,1,0,0,0,0] => [4,5,6,1,2,3,7] => 5
[1,1,0,1,1,0,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,1,1,0,0,0,0] => [4,1,6,2,3,5,7] => 5
[1,1,0,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,1,1,0,0,0,0,0] => [4,6,1,2,3,5,7] => 5
[1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [4,1,2,3,5,6,7] => 3
[1,1,1,0,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,1,0,0,1,0,0] => [1,5,6,2,7,3,4] => 5
[1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,1,0,0,0] => [1,5,6,7,2,3,4] => 5
[1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,1,0,0,1,0,0,0] => [1,5,2,7,3,4,6] => 5
[1,1,1,0,0,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,1,0,1,0,0,0,0] => [1,5,7,2,3,4,6] => 5
[1,1,1,0,1,0,0,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,1,1,0,0,0] => [5,1,2,6,3,4,7] => 5
[1,1,1,0,1,0,0,1,1,0,0,0] => [1,1,1,1,0,1,0,0,1,1,0,0,0,0] => [5,1,6,2,3,4,7] => 5
[1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [5,6,7,1,2,3,4] => 6
[1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,1,0,0,0,0,0] => [5,6,1,2,3,4,7] => 5
[1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,1,0,0] => [5,1,2,3,7,4,6] => 6
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [5,1,2,3,4,6,7] => 4
[1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,1,0,0] => [1,6,2,3,7,4,5] => 5
[1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,1,0,0,0] => [1,6,2,7,3,4,5] => 5
[1,1,1,1,0,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [1,6,7,2,3,4,5] => 5
[1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [6,1,2,3,7,4,5] => 6
[1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,1,1,0,1,0,0,0,1,0,0,0] => [6,1,2,7,3,4,5] => 6
[1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [6,7,1,2,3,4,5] => 6
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [6,1,2,3,4,5,7] => 5
[1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [1,7,2,3,4,5,6] => 5
[1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [7,1,2,3,4,5,6] => 6
[1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7] => 0
[1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [3,4,5,6,7,8,1,2] => 7
[1,0,1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,1,1,0,1,0,0,0,0] => [3,4,6,8,1,2,5,7] => 7
[1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,1,0,1,0,0] => [3,4,1,2,7,8,5,6] => 6
[1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,1,0,1,0,0,0,0] => [3,4,7,8,1,2,5,6] => 7
[1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,1,1,1,1,0,0,0,0,0,0] => [3,4,1,2,5,6,7,8] => 3
>>> Load all 215 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 cardinality of the support of a permutation.
A permutation $\sigma$ may be written as a product $\sigma = s_{i_1}\dots s_{i_k}$ with $k$ minimal, where $s_i = (i,i+1)$ denotes the simple transposition swapping the entries in positions $i$ and $i+1$.
The set of indices $\{i_1,\dots,i_k\}$ is the support of $\sigma$ and independent of the chosen way to write $\sigma$ as such a product.
See [2], Definition 1 and Proposition 10.
The connectivity set of $\sigma$ of length $n$ is the set of indices $1 \leq i < n$ such that $\sigma(k) < i$ for all $k < i$.
Thus, the connectivity set is the complement of the support.
A permutation $\sigma$ may be written as a product $\sigma = s_{i_1}\dots s_{i_k}$ with $k$ minimal, where $s_i = (i,i+1)$ denotes the simple transposition swapping the entries in positions $i$ and $i+1$.
The set of indices $\{i_1,\dots,i_k\}$ is the support of $\sigma$ and independent of the chosen way to write $\sigma$ as such a product.
See [2], Definition 1 and Proposition 10.
The connectivity set of $\sigma$ of length $n$ is the set of indices $1 \leq i < n$ such that $\sigma(k) < i$ for all $k < i$.
Thus, the connectivity set is the complement of the support.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
to 321-avoiding permutation (Billey-Jockusch-Stanley)
Description
The Billey-Jockusch-Stanley bijection to 321-avoiding permutations.
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!