Identifier
Values
[1] => [[1]] => [[1]] => [1] => 0
[1,2] => [[1,0],[0,1]] => [[1,1],[2]] => [3,1,2] => 1
[2,1] => [[0,1],[1,0]] => [[1,2],[2]] => [2,1,3] => 2
[1,2,3] => [[1,0,0],[0,1,0],[0,0,1]] => [[1,1,1],[2,2],[3]] => [6,4,5,1,2,3] => 1
[1,3,2] => [[1,0,0],[0,0,1],[0,1,0]] => [[1,1,1],[2,3],[3]] => [5,4,6,1,2,3] => 2
[2,1,3] => [[0,1,0],[1,0,0],[0,0,1]] => [[1,1,2],[2,2],[3]] => [6,3,4,1,2,5] => 2
[2,3,1] => [[0,0,1],[1,0,0],[0,1,0]] => [[1,1,3],[2,3],[3]] => [4,3,5,1,2,6] => 3
[3,1,2] => [[0,1,0],[0,0,1],[1,0,0]] => [[1,2,2],[2,3],[3]] => [5,2,6,1,3,4] => 3
[3,2,1] => [[0,0,1],[0,1,0],[1,0,0]] => [[1,2,3],[2,3],[3]] => [4,2,5,1,3,6] => 4
[1,2,3,4] => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]] => [[1,1,1,1],[2,2,2],[3,3],[4]] => [10,8,9,5,6,7,1,2,3,4] => 1
[1,2,4,3] => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]] => [[1,1,1,1],[2,2,2],[3,4],[4]] => [9,8,10,5,6,7,1,2,3,4] => 2
[1,3,2,4] => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]] => [[1,1,1,1],[2,2,3],[3,3],[4]] => [10,7,8,5,6,9,1,2,3,4] => 2
[1,3,4,2] => [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]] => [[1,1,1,1],[2,2,4],[3,4],[4]] => [8,7,9,5,6,10,1,2,3,4] => 3
[1,4,2,3] => [[1,0,0,0],[0,0,1,0],[0,0,0,1],[0,1,0,0]] => [[1,1,1,1],[2,3,3],[3,4],[4]] => [9,6,10,5,7,8,1,2,3,4] => 3
[1,4,3,2] => [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]] => [[1,1,1,1],[2,3,4],[3,4],[4]] => [8,6,9,5,7,10,1,2,3,4] => 4
[2,1,3,4] => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]] => [[1,1,1,2],[2,2,2],[3,3],[4]] => [10,8,9,4,5,6,1,2,3,7] => 2
[2,1,4,3] => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]] => [[1,1,1,2],[2,2,2],[3,4],[4]] => [9,8,10,4,5,6,1,2,3,7] => 3
[2,3,1,4] => [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]] => [[1,1,1,3],[2,2,3],[3,3],[4]] => [10,6,7,4,5,8,1,2,3,9] => 3
[2,3,4,1] => [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]] => [[1,1,1,4],[2,2,4],[3,4],[4]] => [7,6,8,4,5,9,1,2,3,10] => 4
[2,4,1,3] => [[0,0,1,0],[1,0,0,0],[0,0,0,1],[0,1,0,0]] => [[1,1,1,3],[2,3,3],[3,4],[4]] => [9,5,10,4,6,7,1,2,3,8] => 4
[2,4,3,1] => [[0,0,0,1],[1,0,0,0],[0,0,1,0],[0,1,0,0]] => [[1,1,1,4],[2,3,4],[3,4],[4]] => [7,5,8,4,6,9,1,2,3,10] => 5
[3,1,2,4] => [[0,1,0,0],[0,0,1,0],[1,0,0,0],[0,0,0,1]] => [[1,1,2,2],[2,2,3],[3,3],[4]] => [10,7,8,3,4,9,1,2,5,6] => 3
[3,1,4,2] => [[0,1,0,0],[0,0,0,1],[1,0,0,0],[0,0,1,0]] => [[1,1,2,2],[2,2,4],[3,4],[4]] => [8,7,9,3,4,10,1,2,5,6] => 4
[3,2,1,4] => [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]] => [[1,1,2,3],[2,2,3],[3,3],[4]] => [10,6,7,3,4,8,1,2,5,9] => 4
[3,2,4,1] => [[0,0,0,1],[0,1,0,0],[1,0,0,0],[0,0,1,0]] => [[1,1,2,4],[2,2,4],[3,4],[4]] => [7,6,8,3,4,9,1,2,5,10] => 5
[3,4,1,2] => [[0,0,1,0],[0,0,0,1],[1,0,0,0],[0,1,0,0]] => [[1,1,3,3],[2,3,4],[3,4],[4]] => [8,4,9,3,5,10,1,2,6,7] => 5
[3,4,2,1] => [[0,0,0,1],[0,0,1,0],[1,0,0,0],[0,1,0,0]] => [[1,1,3,4],[2,3,4],[3,4],[4]] => [7,4,8,3,5,9,1,2,6,10] => 6
[4,1,2,3] => [[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]] => [[1,2,2,2],[2,3,3],[3,4],[4]] => [9,6,10,2,7,8,1,3,4,5] => 4
[4,1,3,2] => [[0,1,0,0],[0,0,0,1],[0,0,1,0],[1,0,0,0]] => [[1,2,2,2],[2,3,4],[3,4],[4]] => [8,6,9,2,7,10,1,3,4,5] => 5
[4,2,1,3] => [[0,0,1,0],[0,1,0,0],[0,0,0,1],[1,0,0,0]] => [[1,2,2,3],[2,3,3],[3,4],[4]] => [9,5,10,2,6,7,1,3,4,8] => 5
[4,2,3,1] => [[0,0,0,1],[0,1,0,0],[0,0,1,0],[1,0,0,0]] => [[1,2,2,4],[2,3,4],[3,4],[4]] => [7,5,8,2,6,9,1,3,4,10] => 6
[4,3,1,2] => [[0,0,1,0],[0,0,0,1],[0,1,0,0],[1,0,0,0]] => [[1,2,3,3],[2,3,4],[3,4],[4]] => [8,4,9,2,5,10,1,3,6,7] => 6
[4,3,2,1] => [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]] => [[1,2,3,4],[2,3,4],[3,4],[4]] => [7,4,8,2,5,9,1,3,6,10] => 7
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
click to show known generating functions       
Description
The number of big ascents of a permutation after prepending zero.
Given a permutation $\pi$ of $\{1,\ldots,n\}$ we set $\pi(0) = 0$ and then count the number of indices $i \in \{0,\ldots,n-1\}$ such that $\pi(i+1) - \pi(i) > 1$.
It was shown in [1, Theorem 1.3] and in [2, Corollary 5.7] that this statistic is equidistributed with the number of descents (St000021The number of descents of a permutation.).
G. Han provided a bijection on permutations sending this statistic to the number of descents [3] using a simple variant of the first fundamental transformation Mp00086first fundamental transformation.
St000646The number of big ascents of a permutation. is the statistic without the border condition $\pi(0) = 0$.
Map
reading word permutation
Description
Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottommost row (in English notation).
Map
to semistandard tableau via monotone triangles
Description
The semistandard tableau corresponding the monotone triangle of an alternating sign matrix.
This is obtained by interpreting each row of the monotone triangle as an integer partition, and filling the cells of the smallest partition with ones, the second smallest with twos, and so on.
Map
to alternating sign matrix
Description
Maps a permutation to its permutation matrix as an alternating sign matrix.