Identifier
-
Mp00027:
Dyck paths
—to partition⟶
Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St001928: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1] => [[1]] => [1] => 0
[1,0,1,0,1,0] => [2,1] => [[1,2],[3]] => [3,1,2] => 1
[1,0,1,1,0,0] => [1,1] => [[1],[2]] => [2,1] => 1
[1,1,0,0,1,0] => [2] => [[1,2]] => [1,2] => 0
[1,1,0,1,0,0] => [1] => [[1]] => [1] => 0
[1,0,1,0,1,0,1,0] => [3,2,1] => [[1,2,3],[4,5],[6]] => [6,4,5,1,2,3] => 2
[1,0,1,0,1,1,0,0] => [2,2,1] => [[1,2],[3,4],[5]] => [5,3,4,1,2] => 2
[1,0,1,1,0,0,1,0] => [3,1,1] => [[1,2,3],[4],[5]] => [5,4,1,2,3] => 1
[1,0,1,1,0,1,0,0] => [2,1,1] => [[1,2],[3],[4]] => [4,3,1,2] => 1
[1,0,1,1,1,0,0,0] => [1,1,1] => [[1],[2],[3]] => [3,2,1] => 1
[1,1,0,0,1,0,1,0] => [3,2] => [[1,2,3],[4,5]] => [4,5,1,2,3] => 1
[1,1,0,0,1,1,0,0] => [2,2] => [[1,2],[3,4]] => [3,4,1,2] => 1
[1,1,0,1,0,0,1,0] => [3,1] => [[1,2,3],[4]] => [4,1,2,3] => 1
[1,1,0,1,0,1,0,0] => [2,1] => [[1,2],[3]] => [3,1,2] => 1
[1,1,0,1,1,0,0,0] => [1,1] => [[1],[2]] => [2,1] => 1
[1,1,1,0,0,0,1,0] => [3] => [[1,2,3]] => [1,2,3] => 0
[1,1,1,0,0,1,0,0] => [2] => [[1,2]] => [1,2] => 0
[1,1,1,0,1,0,0,0] => [1] => [[1]] => [1] => 0
[1,0,1,1,0,1,1,0,0,0] => [2,2,1,1] => [[1,2],[3,4],[5],[6]] => [6,5,3,4,1,2] => 2
[1,0,1,1,1,0,0,1,0,0] => [3,1,1,1] => [[1,2,3],[4],[5],[6]] => [6,5,4,1,2,3] => 2
[1,0,1,1,1,0,1,0,0,0] => [2,1,1,1] => [[1,2],[3],[4],[5]] => [5,4,3,1,2] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => [[1],[2],[3],[4]] => [4,3,2,1] => 2
[1,1,0,0,1,1,1,0,0,0] => [2,2,2] => [[1,2],[3,4],[5,6]] => [5,6,3,4,1,2] => 2
[1,1,0,1,0,1,0,1,0,0] => [3,2,1] => [[1,2,3],[4,5],[6]] => [6,4,5,1,2,3] => 2
[1,1,0,1,0,1,1,0,0,0] => [2,2,1] => [[1,2],[3,4],[5]] => [5,3,4,1,2] => 2
[1,1,0,1,1,0,0,0,1,0] => [4,1,1] => [[1,2,3,4],[5],[6]] => [6,5,1,2,3,4] => 1
[1,1,0,1,1,0,0,1,0,0] => [3,1,1] => [[1,2,3],[4],[5]] => [5,4,1,2,3] => 1
[1,1,0,1,1,0,1,0,0,0] => [2,1,1] => [[1,2],[3],[4]] => [4,3,1,2] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,1,1] => [[1],[2],[3]] => [3,2,1] => 1
[1,1,1,0,0,0,1,1,0,0] => [3,3] => [[1,2,3],[4,5,6]] => [4,5,6,1,2,3] => 1
[1,1,1,0,0,1,0,0,1,0] => [4,2] => [[1,2,3,4],[5,6]] => [5,6,1,2,3,4] => 1
[1,1,1,0,0,1,0,1,0,0] => [3,2] => [[1,2,3],[4,5]] => [4,5,1,2,3] => 1
[1,1,1,0,0,1,1,0,0,0] => [2,2] => [[1,2],[3,4]] => [3,4,1,2] => 1
[1,1,1,0,1,0,0,0,1,0] => [4,1] => [[1,2,3,4],[5]] => [5,1,2,3,4] => 1
[1,1,1,0,1,0,0,1,0,0] => [3,1] => [[1,2,3],[4]] => [4,1,2,3] => 1
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [[1,2],[3]] => [3,1,2] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [[1],[2]] => [2,1] => 1
[1,1,1,1,0,0,0,0,1,0] => [4] => [[1,2,3,4]] => [1,2,3,4] => 0
[1,1,1,1,0,0,0,1,0,0] => [3] => [[1,2,3]] => [1,2,3] => 0
[1,1,1,1,0,0,1,0,0,0] => [2] => [[1,2]] => [1,2] => 0
[1,1,1,1,0,1,0,0,0,0] => [1] => [[1]] => [1] => 0
[1,0,1,1,1,1,0,1,0,0,0,0] => [2,1,1,1,1] => [[1,2],[3],[4],[5],[6]] => [6,5,4,3,1,2] => 2
[1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1] => [[1],[2],[3],[4],[5]] => [5,4,3,2,1] => 2
[1,1,0,1,1,0,1,1,0,0,0,0] => [2,2,1,1] => [[1,2],[3,4],[5],[6]] => [6,5,3,4,1,2] => 2
[1,1,0,1,1,1,0,0,1,0,0,0] => [3,1,1,1] => [[1,2,3],[4],[5],[6]] => [6,5,4,1,2,3] => 2
[1,1,0,1,1,1,0,1,0,0,0,0] => [2,1,1,1] => [[1,2],[3],[4],[5]] => [5,4,3,1,2] => 2
[1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,1] => [[1],[2],[3],[4]] => [4,3,2,1] => 2
[1,1,1,0,0,1,1,1,0,0,0,0] => [2,2,2] => [[1,2],[3,4],[5,6]] => [5,6,3,4,1,2] => 2
[1,1,1,0,1,0,1,0,1,0,0,0] => [3,2,1] => [[1,2,3],[4,5],[6]] => [6,4,5,1,2,3] => 2
[1,1,1,0,1,0,1,1,0,0,0,0] => [2,2,1] => [[1,2],[3,4],[5]] => [5,3,4,1,2] => 2
[1,1,1,0,1,1,0,0,0,1,0,0] => [4,1,1] => [[1,2,3,4],[5],[6]] => [6,5,1,2,3,4] => 1
[1,1,1,0,1,1,0,0,1,0,0,0] => [3,1,1] => [[1,2,3],[4],[5]] => [5,4,1,2,3] => 1
[1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => [[1,2],[3],[4]] => [4,3,1,2] => 1
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => [[1],[2],[3]] => [3,2,1] => 1
[1,1,1,1,0,0,0,1,1,0,0,0] => [3,3] => [[1,2,3],[4,5,6]] => [4,5,6,1,2,3] => 1
[1,1,1,1,0,0,1,0,0,1,0,0] => [4,2] => [[1,2,3,4],[5,6]] => [5,6,1,2,3,4] => 1
[1,1,1,1,0,0,1,0,1,0,0,0] => [3,2] => [[1,2,3],[4,5]] => [4,5,1,2,3] => 1
[1,1,1,1,0,0,1,1,0,0,0,0] => [2,2] => [[1,2],[3,4]] => [3,4,1,2] => 1
[1,1,1,1,0,1,0,0,0,0,1,0] => [5,1] => [[1,2,3,4,5],[6]] => [6,1,2,3,4,5] => 1
[1,1,1,1,0,1,0,0,0,1,0,0] => [4,1] => [[1,2,3,4],[5]] => [5,1,2,3,4] => 1
[1,1,1,1,0,1,0,0,1,0,0,0] => [3,1] => [[1,2,3],[4]] => [4,1,2,3] => 1
[1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [[1,2],[3]] => [3,1,2] => 1
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => [[1],[2]] => [2,1] => 1
[1,1,1,1,1,0,0,0,0,0,1,0] => [5] => [[1,2,3,4,5]] => [1,2,3,4,5] => 0
[1,1,1,1,1,0,0,0,0,1,0,0] => [4] => [[1,2,3,4]] => [1,2,3,4] => 0
[1,1,1,1,1,0,0,0,1,0,0,0] => [3] => [[1,2,3]] => [1,2,3] => 0
[1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [[1,2]] => [1,2] => 0
[1,1,1,1,1,0,1,0,0,0,0,0] => [1] => [[1]] => [1] => 0
[1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1] => [[1],[2],[3],[4],[5],[6]] => [6,5,4,3,2,1] => 3
[1,1,0,1,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1,1] => [[1,2],[3],[4],[5],[6]] => [6,5,4,3,1,2] => 2
[1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1] => [[1],[2],[3],[4],[5]] => [5,4,3,2,1] => 2
[1,1,1,0,1,1,0,1,1,0,0,0,0,0] => [2,2,1,1] => [[1,2],[3,4],[5],[6]] => [6,5,3,4,1,2] => 2
[1,1,1,0,1,1,1,0,0,1,0,0,0,0] => [3,1,1,1] => [[1,2,3],[4],[5],[6]] => [6,5,4,1,2,3] => 2
[1,1,1,0,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1] => [[1,2],[3],[4],[5]] => [5,4,3,1,2] => 2
[1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1] => [[1],[2],[3],[4]] => [4,3,2,1] => 2
[1,1,1,1,0,0,1,1,1,0,0,0,0,0] => [2,2,2] => [[1,2],[3,4],[5,6]] => [5,6,3,4,1,2] => 2
[1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [3,2,1] => [[1,2,3],[4,5],[6]] => [6,4,5,1,2,3] => 2
[1,1,1,1,0,1,0,1,1,0,0,0,0,0] => [2,2,1] => [[1,2],[3,4],[5]] => [5,3,4,1,2] => 2
[1,1,1,1,0,1,1,0,0,0,1,0,0,0] => [4,1,1] => [[1,2,3,4],[5],[6]] => [6,5,1,2,3,4] => 1
[1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [3,1,1] => [[1,2,3],[4],[5]] => [5,4,1,2,3] => 1
[1,1,1,1,0,1,1,0,1,0,0,0,0,0] => [2,1,1] => [[1,2],[3],[4]] => [4,3,1,2] => 1
[1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [1,1,1] => [[1],[2],[3]] => [3,2,1] => 1
[1,1,1,1,1,0,0,0,1,1,0,0,0,0] => [3,3] => [[1,2,3],[4,5,6]] => [4,5,6,1,2,3] => 1
[1,1,1,1,1,0,0,1,0,0,1,0,0,0] => [4,2] => [[1,2,3,4],[5,6]] => [5,6,1,2,3,4] => 1
[1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [3,2] => [[1,2,3],[4,5]] => [4,5,1,2,3] => 1
[1,1,1,1,1,0,0,1,1,0,0,0,0,0] => [2,2] => [[1,2],[3,4]] => [3,4,1,2] => 1
[1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [5,1] => [[1,2,3,4,5],[6]] => [6,1,2,3,4,5] => 1
[1,1,1,1,1,0,1,0,0,0,1,0,0,0] => [4,1] => [[1,2,3,4],[5]] => [5,1,2,3,4] => 1
[1,1,1,1,1,0,1,0,0,1,0,0,0,0] => [3,1] => [[1,2,3],[4]] => [4,1,2,3] => 1
[1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,1] => [[1,2],[3]] => [3,1,2] => 1
[1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,1] => [[1],[2]] => [2,1] => 1
[1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [6] => [[1,2,3,4,5,6]] => [1,2,3,4,5,6] => 0
[1,1,1,1,1,1,0,0,0,0,0,1,0,0] => [5] => [[1,2,3,4,5]] => [1,2,3,4,5] => 0
[1,1,1,1,1,1,0,0,0,0,1,0,0,0] => [4] => [[1,2,3,4]] => [1,2,3,4] => 0
[1,1,1,1,1,1,0,0,0,1,0,0,0,0] => [3] => [[1,2,3]] => [1,2,3] => 0
[1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [2] => [[1,2]] => [1,2] => 0
[1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1] => [[1]] => [1] => 0
[1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1] => [[1],[2],[3],[4],[5],[6]] => [6,5,4,3,2,1] => 3
[1,1,1,0,1,1,1,1,0,1,0,0,0,0,0,0] => [2,1,1,1,1] => [[1,2],[3],[4],[5],[6]] => [6,5,4,3,1,2] => 2
[1,1,1,0,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1] => [[1],[2],[3],[4],[5]] => [5,4,3,2,1] => 2
[1,1,1,1,0,1,1,0,1,1,0,0,0,0,0,0] => [2,2,1,1] => [[1,2],[3,4],[5],[6]] => [6,5,3,4,1,2] => 2
>>> Load all 199 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The number of non-overlapping descents in a permutation.
In other words, any maximal descending subsequence $\pi_i,\pi_{i+1},\dots,\pi_k$ contributes $\lfloor\frac{k-i+1}{2}\rfloor$ to the total count.
In other words, any maximal descending subsequence $\pi_i,\pi_{i+1},\dots,\pi_k$ contributes $\lfloor\frac{k-i+1}{2}\rfloor$ to the total count.
Map
reading word permutation
Description
Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
Map
initial tableau
Description
Sends an integer partition to the standard tableau obtained by filling the numbers $1$ through $n$ row by row.
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!