Identifier
Values
[1,0,1,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,0,1,0,1,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,0,1,1,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,0,0,1,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,0,1,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,0,1,0,1,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,0,1,1,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,0,0,1,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,0,1,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,1,0,0,1,0,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,1,0,1,0,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,1,1,0,1,0,0,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
[1,1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [[1,2,5],[3,4,6]] => 1
[1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [[1,3],[2,4]] => 0
[1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [[1,3,5],[2,4,6]] => 0
[1,1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [[1,3,4],[2,5,6]] => 0
search for individual values
searching the database for the individual values of this statistic
Description
Eigenvalues of the top-to-random operator acting on a simple module.
These eigenvalues are given in [1] and [3].
The simple module of the symmetric group indexed by a partition $\lambda$ has dimension equal to the number of standard tableaux of shape $\lambda$. Hence, the eigenvalues of any linear operator defined on this module can be indexed by standard tableaux of shape $\lambda$; this statistic gives all the eigenvalues of the operator acting on the module.
This statistic bears different names, such as the type in [2] or eig in [3].
Similarly, the eigenvalues of the random-to-random operator acting on a simple module is St000508Eigenvalues of the random-to-random operator acting on a simple module..
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.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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)$.