Identifier
-
Mp00033:
Dyck paths
—to two-row standard tableau⟶
Standard tableaux
Mp00106: Standard tableaux —catabolism⟶ Standard tableaux
St000169: Standard tableaux ⟶ ℤ
Values
[1,0] => [[1],[2]] => [[1,2]] => 0
[1,0,1,0] => [[1,3],[2,4]] => [[1,2,4],[3]] => 2
[1,1,0,0] => [[1,2],[3,4]] => [[1,2,3,4]] => 0
[1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => [[1,2,4,6],[3,5]] => 6
[1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => [[1,2,4,5,6],[3]] => 4
[1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => [[1,2,3,4,6],[5]] => 2
[1,1,0,1,0,0] => [[1,2,4],[3,5,6]] => [[1,2,3,5,6],[4]] => 3
[1,1,1,0,0,0] => [[1,2,3],[4,5,6]] => [[1,2,3,4,5,6]] => 0
[1,0,1,0,1,0,1,0] => [[1,3,5,7],[2,4,6,8]] => [[1,2,4,6,8],[3,5,7]] => 12
[1,0,1,0,1,1,0,0] => [[1,3,5,6],[2,4,7,8]] => [[1,2,4,6,7,8],[3,5]] => 10
[1,0,1,1,0,0,1,0] => [[1,3,4,7],[2,5,6,8]] => [[1,2,4,5,6,8],[3,7]] => 8
[1,0,1,1,0,1,0,0] => [[1,3,4,6],[2,5,7,8]] => [[1,2,4,5,7,8],[3,6]] => 9
[1,0,1,1,1,0,0,0] => [[1,3,4,5],[2,6,7,8]] => [[1,2,4,5,6,7,8],[3]] => 6
[1,1,0,0,1,0,1,0] => [[1,2,5,7],[3,4,6,8]] => [[1,2,3,4,6,8],[5,7]] => 6
[1,1,0,0,1,1,0,0] => [[1,2,5,6],[3,4,7,8]] => [[1,2,3,4,7,8],[5,6]] => 4
[1,1,0,1,0,0,1,0] => [[1,2,4,7],[3,5,6,8]] => [[1,2,3,5,6,8],[4,7]] => 7
[1,1,0,1,0,1,0,0] => [[1,2,4,6],[3,5,7,8]] => [[1,2,3,5,7,8],[4,6]] => 8
[1,1,0,1,1,0,0,0] => [[1,2,4,5],[3,6,7,8]] => [[1,2,3,5,6,7,8],[4]] => 5
[1,1,1,0,0,0,1,0] => [[1,2,3,7],[4,5,6,8]] => [[1,2,3,4,5,6,8],[7]] => 2
[1,1,1,0,0,1,0,0] => [[1,2,3,6],[4,5,7,8]] => [[1,2,3,4,5,7,8],[6]] => 3
[1,1,1,0,1,0,0,0] => [[1,2,3,5],[4,6,7,8]] => [[1,2,3,4,6,7,8],[5]] => 4
[1,1,1,1,0,0,0,0] => [[1,2,3,4],[5,6,7,8]] => [[1,2,3,4,5,6,7,8]] => 0
[1,0,1,0,1,0,1,0,1,0] => [[1,3,5,7,9],[2,4,6,8,10]] => [[1,2,4,6,8,10],[3,5,7,9]] => 20
[1,0,1,0,1,0,1,1,0,0] => [[1,3,5,7,8],[2,4,6,9,10]] => [[1,2,4,6,8,9,10],[3,5,7]] => 18
[1,0,1,0,1,1,0,0,1,0] => [[1,3,5,6,9],[2,4,7,8,10]] => [[1,2,4,6,7,8,10],[3,5,9]] => 16
[1,0,1,0,1,1,0,1,0,0] => [[1,3,5,6,8],[2,4,7,9,10]] => [[1,2,4,6,7,9,10],[3,5,8]] => 17
[1,0,1,0,1,1,1,0,0,0] => [[1,3,5,6,7],[2,4,8,9,10]] => [[1,2,4,6,7,8,9,10],[3,5]] => 14
[1,0,1,1,0,0,1,0,1,0] => [[1,3,4,7,9],[2,5,6,8,10]] => [[1,2,4,5,6,8,10],[3,7,9]] => 14
[1,0,1,1,0,0,1,1,0,0] => [[1,3,4,7,8],[2,5,6,9,10]] => [[1,2,4,5,6,9,10],[3,7,8]] => 12
[1,0,1,1,0,1,0,0,1,0] => [[1,3,4,6,9],[2,5,7,8,10]] => [[1,2,4,5,7,8,10],[3,6,9]] => 15
[1,0,1,1,0,1,0,1,0,0] => [[1,3,4,6,8],[2,5,7,9,10]] => [[1,2,4,5,7,9,10],[3,6,8]] => 16
[1,0,1,1,0,1,1,0,0,0] => [[1,3,4,6,7],[2,5,8,9,10]] => [[1,2,4,5,7,8,9,10],[3,6]] => 13
[1,0,1,1,1,0,0,0,1,0] => [[1,3,4,5,9],[2,6,7,8,10]] => [[1,2,4,5,6,7,8,10],[3,9]] => 10
[1,0,1,1,1,0,0,1,0,0] => [[1,3,4,5,8],[2,6,7,9,10]] => [[1,2,4,5,6,7,9,10],[3,8]] => 11
[1,0,1,1,1,0,1,0,0,0] => [[1,3,4,5,7],[2,6,8,9,10]] => [[1,2,4,5,6,8,9,10],[3,7]] => 12
[1,0,1,1,1,1,0,0,0,0] => [[1,3,4,5,6],[2,7,8,9,10]] => [[1,2,4,5,6,7,8,9,10],[3]] => 8
[1,1,0,0,1,0,1,0,1,0] => [[1,2,5,7,9],[3,4,6,8,10]] => [[1,2,3,4,6,8,10],[5,7,9]] => 12
[1,1,0,0,1,0,1,1,0,0] => [[1,2,5,7,8],[3,4,6,9,10]] => [[1,2,3,4,6,9,10],[5,7,8]] => 10
[1,1,0,0,1,1,0,0,1,0] => [[1,2,5,6,9],[3,4,7,8,10]] => [[1,2,3,4,7,8,10],[5,6,9]] => 8
[1,1,0,0,1,1,0,1,0,0] => [[1,2,5,6,8],[3,4,7,9,10]] => [[1,2,3,4,7,9,10],[5,6,8]] => 9
[1,1,0,0,1,1,1,0,0,0] => [[1,2,5,6,7],[3,4,8,9,10]] => [[1,2,3,4,7,8,9,10],[5,6]] => 6
[1,1,0,1,0,0,1,0,1,0] => [[1,2,4,7,9],[3,5,6,8,10]] => [[1,2,3,5,6,8,10],[4,7,9]] => 13
[1,1,0,1,0,0,1,1,0,0] => [[1,2,4,7,8],[3,5,6,9,10]] => [[1,2,3,5,6,9,10],[4,7,8]] => 11
[1,1,0,1,0,1,0,0,1,0] => [[1,2,4,6,9],[3,5,7,8,10]] => [[1,2,3,5,7,8,10],[4,6,9]] => 14
[1,1,0,1,0,1,0,1,0,0] => [[1,2,4,6,8],[3,5,7,9,10]] => [[1,2,3,5,7,9,10],[4,6,8]] => 15
[1,1,0,1,0,1,1,0,0,0] => [[1,2,4,6,7],[3,5,8,9,10]] => [[1,2,3,5,7,8,9,10],[4,6]] => 12
[1,1,0,1,1,0,0,0,1,0] => [[1,2,4,5,9],[3,6,7,8,10]] => [[1,2,3,5,6,7,8,10],[4,9]] => 9
[1,1,0,1,1,0,0,1,0,0] => [[1,2,4,5,8],[3,6,7,9,10]] => [[1,2,3,5,6,7,9,10],[4,8]] => 10
[1,1,0,1,1,0,1,0,0,0] => [[1,2,4,5,7],[3,6,8,9,10]] => [[1,2,3,5,6,8,9,10],[4,7]] => 11
[1,1,0,1,1,1,0,0,0,0] => [[1,2,4,5,6],[3,7,8,9,10]] => [[1,2,3,5,6,7,8,9,10],[4]] => 7
[1,1,1,0,0,0,1,0,1,0] => [[1,2,3,7,9],[4,5,6,8,10]] => [[1,2,3,4,5,6,8,10],[7,9]] => 6
[1,1,1,0,0,0,1,1,0,0] => [[1,2,3,7,8],[4,5,6,9,10]] => [[1,2,3,4,5,6,9,10],[7,8]] => 4
[1,1,1,0,0,1,0,0,1,0] => [[1,2,3,6,9],[4,5,7,8,10]] => [[1,2,3,4,5,7,8,10],[6,9]] => 7
[1,1,1,0,0,1,0,1,0,0] => [[1,2,3,6,8],[4,5,7,9,10]] => [[1,2,3,4,5,7,9,10],[6,8]] => 8
[1,1,1,0,0,1,1,0,0,0] => [[1,2,3,6,7],[4,5,8,9,10]] => [[1,2,3,4,5,8,9,10],[6,7]] => 5
[1,1,1,0,1,0,0,0,1,0] => [[1,2,3,5,9],[4,6,7,8,10]] => [[1,2,3,4,6,7,8,10],[5,9]] => 8
[1,1,1,0,1,0,0,1,0,0] => [[1,2,3,5,8],[4,6,7,9,10]] => [[1,2,3,4,6,7,9,10],[5,8]] => 9
[1,1,1,0,1,0,1,0,0,0] => [[1,2,3,5,7],[4,6,8,9,10]] => [[1,2,3,4,6,8,9,10],[5,7]] => 10
[1,1,1,0,1,1,0,0,0,0] => [[1,2,3,5,6],[4,7,8,9,10]] => [[1,2,3,4,6,7,8,9,10],[5]] => 6
[1,1,1,1,0,0,0,0,1,0] => [[1,2,3,4,9],[5,6,7,8,10]] => [[1,2,3,4,5,6,7,8,10],[9]] => 2
[1,1,1,1,0,0,0,1,0,0] => [[1,2,3,4,8],[5,6,7,9,10]] => [[1,2,3,4,5,6,7,9,10],[8]] => 3
[1,1,1,1,0,0,1,0,0,0] => [[1,2,3,4,7],[5,6,8,9,10]] => [[1,2,3,4,5,6,8,9,10],[7]] => 4
[1,1,1,1,0,1,0,0,0,0] => [[1,2,3,4,6],[5,7,8,9,10]] => [[1,2,3,4,5,7,8,9,10],[6]] => 5
[1,1,1,1,1,0,0,0,0,0] => [[1,2,3,4,5],[6,7,8,9,10]] => [[1,2,3,4,5,6,7,8,9,10]] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [[1,3,5,7,9,11],[2,4,6,8,10,12]] => [[1,2,4,6,8,10,12],[3,5,7,9,11]] => 30
[1,0,1,0,1,0,1,0,1,1,0,0] => [[1,3,5,7,9,10],[2,4,6,8,11,12]] => [[1,2,4,6,8,10,11,12],[3,5,7,9]] => 28
[1,0,1,0,1,0,1,1,0,0,1,0] => [[1,3,5,7,8,11],[2,4,6,9,10,12]] => [[1,2,4,6,8,9,10,12],[3,5,7,11]] => 26
[1,0,1,0,1,0,1,1,0,1,0,0] => [[1,3,5,7,8,10],[2,4,6,9,11,12]] => [[1,2,4,6,8,9,11,12],[3,5,7,10]] => 27
[1,0,1,0,1,0,1,1,1,0,0,0] => [[1,3,5,7,8,9],[2,4,6,10,11,12]] => [[1,2,4,6,8,9,10,11,12],[3,5,7]] => 24
[1,0,1,0,1,1,0,0,1,0,1,0] => [[1,3,5,6,9,11],[2,4,7,8,10,12]] => [[1,2,4,6,7,8,10,12],[3,5,9,11]] => 24
[1,0,1,0,1,1,0,0,1,1,0,0] => [[1,3,5,6,9,10],[2,4,7,8,11,12]] => [[1,2,4,6,7,8,11,12],[3,5,9,10]] => 22
[1,0,1,0,1,1,0,1,0,0,1,0] => [[1,3,5,6,8,11],[2,4,7,9,10,12]] => [[1,2,4,6,7,9,10,12],[3,5,8,11]] => 25
[1,0,1,0,1,1,0,1,0,1,0,0] => [[1,3,5,6,8,10],[2,4,7,9,11,12]] => [[1,2,4,6,7,9,11,12],[3,5,8,10]] => 26
[1,0,1,0,1,1,0,1,1,0,0,0] => [[1,3,5,6,8,9],[2,4,7,10,11,12]] => [[1,2,4,6,7,9,10,11,12],[3,5,8]] => 23
[1,0,1,0,1,1,1,0,0,0,1,0] => [[1,3,5,6,7,11],[2,4,8,9,10,12]] => [[1,2,4,6,7,8,9,10,12],[3,5,11]] => 20
[1,0,1,0,1,1,1,0,0,1,0,0] => [[1,3,5,6,7,10],[2,4,8,9,11,12]] => [[1,2,4,6,7,8,9,11,12],[3,5,10]] => 21
[1,0,1,0,1,1,1,0,1,0,0,0] => [[1,3,5,6,7,9],[2,4,8,10,11,12]] => [[1,2,4,6,7,8,10,11,12],[3,5,9]] => 22
[1,0,1,0,1,1,1,1,0,0,0,0] => [[1,3,5,6,7,8],[2,4,9,10,11,12]] => [[1,2,4,6,7,8,9,10,11,12],[3,5]] => 18
[1,0,1,1,0,0,1,0,1,0,1,0] => [[1,3,4,7,9,11],[2,5,6,8,10,12]] => [[1,2,4,5,6,8,10,12],[3,7,9,11]] => 22
[1,0,1,1,0,0,1,0,1,1,0,0] => [[1,3,4,7,9,10],[2,5,6,8,11,12]] => [[1,2,4,5,6,8,11,12],[3,7,9,10]] => 20
[1,0,1,1,0,0,1,1,0,0,1,0] => [[1,3,4,7,8,11],[2,5,6,9,10,12]] => [[1,2,4,5,6,9,10,12],[3,7,8,11]] => 18
[1,0,1,1,0,0,1,1,0,1,0,0] => [[1,3,4,7,8,10],[2,5,6,9,11,12]] => [[1,2,4,5,6,9,11,12],[3,7,8,10]] => 19
[1,0,1,1,0,0,1,1,1,0,0,0] => [[1,3,4,7,8,9],[2,5,6,10,11,12]] => [[1,2,4,5,6,9,10,11,12],[3,7,8]] => 16
[1,0,1,1,0,1,0,0,1,0,1,0] => [[1,3,4,6,9,11],[2,5,7,8,10,12]] => [[1,2,4,5,7,8,10,12],[3,6,9,11]] => 23
[1,0,1,1,0,1,0,0,1,1,0,0] => [[1,3,4,6,9,10],[2,5,7,8,11,12]] => [[1,2,4,5,7,8,11,12],[3,6,9,10]] => 21
[1,0,1,1,0,1,0,1,0,0,1,0] => [[1,3,4,6,8,11],[2,5,7,9,10,12]] => [[1,2,4,5,7,9,10,12],[3,6,8,11]] => 24
[1,0,1,1,0,1,0,1,0,1,0,0] => [[1,3,4,6,8,10],[2,5,7,9,11,12]] => [[1,2,4,5,7,9,11,12],[3,6,8,10]] => 25
[1,0,1,1,0,1,0,1,1,0,0,0] => [[1,3,4,6,8,9],[2,5,7,10,11,12]] => [[1,2,4,5,7,9,10,11,12],[3,6,8]] => 22
[1,0,1,1,0,1,1,0,0,0,1,0] => [[1,3,4,6,7,11],[2,5,8,9,10,12]] => [[1,2,4,5,7,8,9,10,12],[3,6,11]] => 19
[1,0,1,1,0,1,1,0,0,1,0,0] => [[1,3,4,6,7,10],[2,5,8,9,11,12]] => [[1,2,4,5,7,8,9,11,12],[3,6,10]] => 20
[1,0,1,1,0,1,1,0,1,0,0,0] => [[1,3,4,6,7,9],[2,5,8,10,11,12]] => [[1,2,4,5,7,8,10,11,12],[3,6,9]] => 21
[1,0,1,1,0,1,1,1,0,0,0,0] => [[1,3,4,6,7,8],[2,5,9,10,11,12]] => [[1,2,4,5,7,8,9,10,11,12],[3,6]] => 17
[1,0,1,1,1,0,0,0,1,0,1,0] => [[1,3,4,5,9,11],[2,6,7,8,10,12]] => [[1,2,4,5,6,7,8,10,12],[3,9,11]] => 16
[1,0,1,1,1,0,0,0,1,1,0,0] => [[1,3,4,5,9,10],[2,6,7,8,11,12]] => [[1,2,4,5,6,7,8,11,12],[3,9,10]] => 14
[1,0,1,1,1,0,0,1,0,0,1,0] => [[1,3,4,5,8,11],[2,6,7,9,10,12]] => [[1,2,4,5,6,7,9,10,12],[3,8,11]] => 17
[1,0,1,1,1,0,0,1,0,1,0,0] => [[1,3,4,5,8,10],[2,6,7,9,11,12]] => [[1,2,4,5,6,7,9,11,12],[3,8,10]] => 18
[1,0,1,1,1,0,0,1,1,0,0,0] => [[1,3,4,5,8,9],[2,6,7,10,11,12]] => [[1,2,4,5,6,7,10,11,12],[3,8,9]] => 15
[1,0,1,1,1,0,1,0,0,0,1,0] => [[1,3,4,5,7,11],[2,6,8,9,10,12]] => [[1,2,4,5,6,8,9,10,12],[3,7,11]] => 18
[1,0,1,1,1,0,1,0,0,1,0,0] => [[1,3,4,5,7,10],[2,6,8,9,11,12]] => [[1,2,4,5,6,8,9,11,12],[3,7,10]] => 19
[1,0,1,1,1,0,1,0,1,0,0,0] => [[1,3,4,5,7,9],[2,6,8,10,11,12]] => [[1,2,4,5,6,8,10,11,12],[3,7,9]] => 20
[1,0,1,1,1,0,1,1,0,0,0,0] => [[1,3,4,5,7,8],[2,6,9,10,11,12]] => [[1,2,4,5,6,8,9,10,11,12],[3,7]] => 16
>>> 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 cocharge of a standard tableau.
The cocharge of a standard tableau $T$, denoted $\mathrm{cc}(T)$, is defined to be the cocharge of the reading word of the tableau. The cocharge of a permutation $w_1 w_2\cdots w_n$ can be computed by the following algorithm:
1) Starting from $w_n$, scan the entries right-to-left until finding the entry $1$ with a superscript $0$.
2) Continue scanning until the $2$ is found, and label this with a superscript $1$. Then scan until the $3$ is found, labeling with a $2$, and so on, incrementing the label each time, until the beginning of the word is reached. Then go back to the end and scan again from right to left, and *do not* increment the superscript label for the first number found in the next scan. Then continue scanning and labeling, each time incrementing the superscript only if we have not cycled around the word since the last labeling.
3) The cocharge is defined as the sum of the superscript labels on the letters.
The cocharge of a standard tableau $T$, denoted $\mathrm{cc}(T)$, is defined to be the cocharge of the reading word of the tableau. The cocharge of a permutation $w_1 w_2\cdots w_n$ can be computed by the following algorithm:
1) Starting from $w_n$, scan the entries right-to-left until finding the entry $1$ with a superscript $0$.
2) Continue scanning until the $2$ is found, and label this with a superscript $1$. Then scan until the $3$ is found, labeling with a $2$, and so on, incrementing the label each time, until the beginning of the word is reached. Then go back to the end and scan again from right to left, and *do not* increment the superscript label for the first number found in the next scan. Then continue scanning and labeling, each time incrementing the superscript only if we have not cycled around the word since the last labeling.
3) The cocharge is defined as the sum of the superscript labels on the letters.
Map
to two-row standard tableau
Description
Return a standard tableau of shape $(n,n)$ where $n$ is the semilength of the Dyck path.
Given a Dyck path $D$, its image is given by recording the positions of the up-steps in the first row and the positions of the down-steps in the second row.
Given a Dyck path $D$, its image is given by recording the positions of the up-steps in the first row and the positions of the down-steps in the second row.
Map
catabolism
Description
Remove the first row of the standard tableau and insert it back using column Schensted insertion, starting with the largest number.
The algorithm for column-inserting an entry $k$ into tableau $T$ is as follows:
If $k$ is larger than all entries in the first column, place $k$ at the bottom of the first column and the procedure is finished. Otherwise, place $k$ in the first column, replacing the smallest entry, $y$, greater than $k$. Now insert $y$ into the second column using the same procedure: if $y$ is greater than all entries in the second column, place it at the bottom of that column (provided that the result is still a tableau). Otherwise, place $y$ in the second column, replacing, or 'bumping', the smallest entry, $z$, larger than $y$. Continue the procedure until we have placed a bumped entry at the bottom of a column (or on its own in a new column).
The algorithm for column-inserting an entry $k$ into tableau $T$ is as follows:
If $k$ is larger than all entries in the first column, place $k$ at the bottom of the first column and the procedure is finished. Otherwise, place $k$ in the first column, replacing the smallest entry, $y$, greater than $k$. Now insert $y$ into the second column using the same procedure: if $y$ is greater than all entries in the second column, place it at the bottom of that column (provided that the result is still a tableau). Otherwise, place $y$ in the second column, replacing, or 'bumping', the smallest entry, $z$, larger than $y$. Continue the procedure until we have placed a bumped entry at the bottom of a column (or on its own in a new column).
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!