Identifier
-
Mp00001:
Alternating sign matrices
—to semistandard tableau via monotone triangles⟶
Semistandard tableaux
Mp00075: Semistandard tableaux —reading word permutation⟶ Permutations
St000696: Permutations ⟶ ℤ
Values
[[1]] => [[1]] => [1] => 2
[[1,0],[0,1]] => [[1,1],[2]] => [3,1,2] => 2
[[0,1],[1,0]] => [[1,2],[2]] => [2,1,3] => 2
[[1,0,0],[0,1,0],[0,0,1]] => [[1,1,1],[2,2],[3]] => [6,4,5,1,2,3] => 5
[[0,1,0],[1,0,0],[0,0,1]] => [[1,1,2],[2,2],[3]] => [6,3,4,1,2,5] => 3
[[1,0,0],[0,0,1],[0,1,0]] => [[1,1,1],[2,3],[3]] => [5,4,6,1,2,3] => 3
[[0,1,0],[1,-1,1],[0,1,0]] => [[1,1,2],[2,3],[3]] => [5,3,6,1,2,4] => 3
[[0,0,1],[1,0,0],[0,1,0]] => [[1,1,3],[2,3],[3]] => [4,3,5,1,2,6] => 3
[[0,1,0],[0,0,1],[1,0,0]] => [[1,2,2],[2,3],[3]] => [5,2,6,1,3,4] => 3
[[0,0,1],[0,1,0],[1,0,0]] => [[1,2,3],[2,3],[3]] => [4,2,5,1,3,6] => 3
[[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] => 7
[[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] => 7
[[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] => 7
[[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]] => [[1,1,1,2],[2,2,3],[3,3],[4]] => [10,7,8,4,5,9,1,2,3,6] => 7
[[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] => 5
[[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] => 7
[[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] => 5
[[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] => 7
[[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] => 5
[[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]] => [[1,1,1,1],[2,2,3],[3,4],[4]] => [9,7,10,5,6,8,1,2,3,4] => 7
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]] => [[1,1,1,2],[2,2,3],[3,4],[4]] => [9,7,10,4,5,8,1,2,3,6] => 5
[[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]] => [[1,1,1,3],[2,2,3],[3,4],[4]] => [9,6,10,4,5,7,1,2,3,8] => 5
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]] => [[1,1,2,2],[2,2,3],[3,4],[4]] => [9,7,10,3,4,8,1,2,5,6] => 5
[[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]] => [[1,1,2,3],[2,2,3],[3,4],[4]] => [9,6,10,3,4,7,1,2,5,8] => 3
[[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] => 5
[[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]] => [[1,1,1,2],[2,2,4],[3,4],[4]] => [8,7,9,4,5,10,1,2,3,6] => 5
[[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]] => [[1,1,1,3],[2,2,4],[3,4],[4]] => [8,6,9,4,5,10,1,2,3,7] => 5
[[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] => 5
[[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] => 5
[[0,0,1,0],[0,1,-1,1],[1,0,0,0],[0,0,1,0]] => [[1,1,2,3],[2,2,4],[3,4],[4]] => [8,6,9,3,4,10,1,2,5,7] => 5
[[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
[[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] => 7
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]] => [[1,1,1,2],[2,3,3],[3,4],[4]] => [9,6,10,4,7,8,1,2,3,5] => 5
[[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] => 5
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]] => [[1,1,2,2],[2,3,3],[3,4],[4]] => [9,6,10,3,7,8,1,2,4,5] => 5
[[0,0,1,0],[0,1,0,0],[1,-1,0,1],[0,1,0,0]] => [[1,1,2,3],[2,3,3],[3,4],[4]] => [9,5,10,3,6,7,1,2,4,8] => 3
[[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] => 5
[[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]] => [[1,1,1,2],[2,3,4],[3,4],[4]] => [8,6,9,4,7,10,1,2,3,5] => 3
[[0,0,1,0],[1,0,-1,1],[0,0,1,0],[0,1,0,0]] => [[1,1,1,3],[2,3,4],[3,4],[4]] => [8,5,9,4,6,10,1,2,3,7] => 5
[[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
[[0,1,0,0],[0,0,0,1],[1,-1,1,0],[0,1,0,0]] => [[1,1,2,2],[2,3,4],[3,4],[4]] => [8,6,9,3,7,10,1,2,4,5] => 3
[[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]] => [[1,1,2,3],[2,3,4],[3,4],[4]] => [8,5,9,3,6,10,1,2,4,7] => 3
[[0,0,0,1],[0,1,0,0],[1,-1,1,0],[0,1,0,0]] => [[1,1,2,4],[2,3,4],[3,4],[4]] => [7,5,8,3,6,9,1,2,4,10] => 3
[[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
[[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] => 5
[[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] => 5
[[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] => 3
[[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] => 3
[[0,0,1,0],[0,1,-1,1],[0,0,1,0],[1,0,0,0]] => [[1,2,2,3],[2,3,4],[3,4],[4]] => [8,5,9,2,6,10,1,3,4,7] => 3
[[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] => 3
[[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] => 3
[[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] => 3
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 number of cycles in the breakpoint graph of a permutation.
The breakpoint graph of a permutation $\pi_1,\dots,\pi_n$ is the directed, bicoloured graph with vertices $0,\dots,n$, a grey edge from $i$ to $i+1$ and a black edge from $\pi_i$ to $\pi_{i-1}$ for $0\leq i\leq n$, all indices taken modulo $n+1$.
This graph decomposes into alternating cycles, which this statistic counts.
The distribution of this statistic on permutations of $n-1$ is, according to [cor.1, 5] and [eq.6, 6], given by
$$ \frac{1}{n(n+1)}((q+n)_{n+1}-(q)_{n+1}), $$
where $(x)_n=x(x-1)\dots(x-n+1)$.
The breakpoint graph of a permutation $\pi_1,\dots,\pi_n$ is the directed, bicoloured graph with vertices $0,\dots,n$, a grey edge from $i$ to $i+1$ and a black edge from $\pi_i$ to $\pi_{i-1}$ for $0\leq i\leq n$, all indices taken modulo $n+1$.
This graph decomposes into alternating cycles, which this statistic counts.
The distribution of this statistic on permutations of $n-1$ is, according to [cor.1, 5] and [eq.6, 6], given by
$$ \frac{1}{n(n+1)}((q+n)_{n+1}-(q)_{n+1}), $$
where $(x)_n=x(x-1)\dots(x-n+1)$.
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.
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.
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!