Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000278
St000278: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 1
[2]
=> 1
[1,1]
=> 1
[3]
=> 1
[2,1]
=> 2
[1,1,1]
=> 1
[4]
=> 1
[3,1]
=> 2
[2,2]
=> 1
[2,1,1]
=> 3
[1,1,1,1]
=> 1
[5]
=> 1
[4,1]
=> 2
[3,2]
=> 2
[3,1,1]
=> 3
[2,2,1]
=> 3
[2,1,1,1]
=> 4
[1,1,1,1,1]
=> 1
[6]
=> 1
[5,1]
=> 2
[4,2]
=> 2
[4,1,1]
=> 3
[3,3]
=> 1
[3,2,1]
=> 6
[3,1,1,1]
=> 4
[2,2,2]
=> 1
[2,2,1,1]
=> 6
[2,1,1,1,1]
=> 5
[1,1,1,1,1,1]
=> 1
[7]
=> 1
[6,1]
=> 2
[5,2]
=> 2
[5,1,1]
=> 3
[4,3]
=> 2
[4,2,1]
=> 6
[4,1,1,1]
=> 4
[3,3,1]
=> 3
[3,2,2]
=> 3
[3,2,1,1]
=> 12
[3,1,1,1,1]
=> 5
[2,2,2,1]
=> 4
[2,2,1,1,1]
=> 10
[2,1,1,1,1,1]
=> 6
[1,1,1,1,1,1,1]
=> 1
[8]
=> 1
[7,1]
=> 2
[6,2]
=> 2
[6,1,1]
=> 3
[5,3]
=> 2
[5,2,1]
=> 6
Description
The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. This is the multinomial of the multiplicities of the parts, see [1]. This is the same as $m_\lambda(x_1,\dotsc,x_k)$ evaluated at $x_1=\dotsb=x_k=1$, where $k$ is the number of parts of $\lambda$. An explicit formula is $\frac{k!}{m_1(\lambda)! m_2(\lambda)! \dotsb m_k(\lambda) !}$ where $m_i(\lambda)$ is the number of parts of $\lambda$ equal to $i$.
Matching statistic: St000886
Mp00042: Integer partitions initial tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00068: Permutations Simion-Schmidt mapPermutations
St000886: Permutations ⟶ ℤResult quality: 10% values known / values provided: 10%distinct values known / distinct values provided: 19%
Values
[1]
=> [[1]]
=> [1] => [1] => ? = 1
[2]
=> [[1,2]]
=> [1,2] => [1,2] => 1
[1,1]
=> [[1],[2]]
=> [2,1] => [2,1] => 1
[3]
=> [[1,2,3]]
=> [1,2,3] => [1,3,2] => 1
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => [3,1,2] => 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [3,2,1] => 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [1,4,3,2] => 1
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => [4,1,3,2] => 2
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [3,4,1,2] => 1
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => [4,3,1,2] => 3
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [4,3,2,1] => 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [1,5,4,3,2] => 1
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => [5,1,4,3,2] => 2
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => [4,5,1,3,2] => 2
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => [5,4,1,3,2] => 3
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => [5,3,4,1,2] => 3
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => [5,4,3,1,2] => 4
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [1,6,5,4,3,2] => 1
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => [6,1,5,4,3,2] => 2
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => [5,6,1,4,3,2] => 2
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => [6,5,1,4,3,2] => 3
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [4,6,5,1,3,2] => 1
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => [6,4,5,1,3,2] => 6
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => [6,5,4,1,3,2] => 4
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [5,6,3,4,1,2] => 1
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => [6,5,3,4,1,2] => 6
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => [6,5,4,3,1,2] => 5
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [6,5,4,3,2,1] => 1
[7]
=> [[1,2,3,4,5,6,7]]
=> [1,2,3,4,5,6,7] => [1,7,6,5,4,3,2] => ? = 1
[6,1]
=> [[1,2,3,4,5,6],[7]]
=> [7,1,2,3,4,5,6] => [7,1,6,5,4,3,2] => ? = 2
[5,2]
=> [[1,2,3,4,5],[6,7]]
=> [6,7,1,2,3,4,5] => [6,7,1,5,4,3,2] => ? = 2
[5,1,1]
=> [[1,2,3,4,5],[6],[7]]
=> [7,6,1,2,3,4,5] => [7,6,1,5,4,3,2] => ? = 3
[4,3]
=> [[1,2,3,4],[5,6,7]]
=> [5,6,7,1,2,3,4] => [5,7,6,1,4,3,2] => ? = 2
[4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> [7,5,6,1,2,3,4] => [7,5,6,1,4,3,2] => ? = 6
[4,1,1,1]
=> [[1,2,3,4],[5],[6],[7]]
=> [7,6,5,1,2,3,4] => [7,6,5,1,4,3,2] => ? = 4
[3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> [7,4,5,6,1,2,3] => [7,4,6,5,1,3,2] => ? = 3
[3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> [6,7,4,5,1,2,3] => [6,7,4,5,1,3,2] => ? = 3
[3,2,1,1]
=> [[1,2,3],[4,5],[6],[7]]
=> [7,6,4,5,1,2,3] => [7,6,4,5,1,3,2] => ? = 12
[3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> [7,6,5,4,1,2,3] => [7,6,5,4,1,3,2] => ? = 5
[2,2,2,1]
=> [[1,2],[3,4],[5,6],[7]]
=> [7,5,6,3,4,1,2] => [7,5,6,3,4,1,2] => ? = 4
[2,2,1,1,1]
=> [[1,2],[3,4],[5],[6],[7]]
=> [7,6,5,3,4,1,2] => [7,6,5,3,4,1,2] => ? = 10
[2,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7]]
=> [7,6,5,4,3,1,2] => [7,6,5,4,3,1,2] => ? = 6
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [7,6,5,4,3,2,1] => [7,6,5,4,3,2,1] => ? = 1
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [1,2,3,4,5,6,7,8] => [1,8,7,6,5,4,3,2] => ? = 1
[7,1]
=> [[1,2,3,4,5,6,7],[8]]
=> [8,1,2,3,4,5,6,7] => [8,1,7,6,5,4,3,2] => ? = 2
[6,2]
=> [[1,2,3,4,5,6],[7,8]]
=> [7,8,1,2,3,4,5,6] => [7,8,1,6,5,4,3,2] => ? = 2
[6,1,1]
=> [[1,2,3,4,5,6],[7],[8]]
=> [8,7,1,2,3,4,5,6] => [8,7,1,6,5,4,3,2] => ? = 3
[5,3]
=> [[1,2,3,4,5],[6,7,8]]
=> [6,7,8,1,2,3,4,5] => [6,8,7,1,5,4,3,2] => ? = 2
[5,2,1]
=> [[1,2,3,4,5],[6,7],[8]]
=> [8,6,7,1,2,3,4,5] => [8,6,7,1,5,4,3,2] => ? = 6
[5,1,1,1]
=> [[1,2,3,4,5],[6],[7],[8]]
=> [8,7,6,1,2,3,4,5] => [8,7,6,1,5,4,3,2] => ? = 4
[4,4]
=> [[1,2,3,4],[5,6,7,8]]
=> [5,6,7,8,1,2,3,4] => [5,8,7,6,1,4,3,2] => ? = 1
[4,3,1]
=> [[1,2,3,4],[5,6,7],[8]]
=> [8,5,6,7,1,2,3,4] => [8,5,7,6,1,4,3,2] => ? = 6
[4,2,2]
=> [[1,2,3,4],[5,6],[7,8]]
=> [7,8,5,6,1,2,3,4] => [7,8,5,6,1,4,3,2] => ? = 3
[4,2,1,1]
=> [[1,2,3,4],[5,6],[7],[8]]
=> [8,7,5,6,1,2,3,4] => [8,7,5,6,1,4,3,2] => ? = 12
[4,1,1,1,1]
=> [[1,2,3,4],[5],[6],[7],[8]]
=> [8,7,6,5,1,2,3,4] => [8,7,6,5,1,4,3,2] => ? = 5
[3,3,2]
=> [[1,2,3],[4,5,6],[7,8]]
=> [7,8,4,5,6,1,2,3] => [7,8,4,6,5,1,3,2] => ? = 3
[3,3,1,1]
=> [[1,2,3],[4,5,6],[7],[8]]
=> [8,7,4,5,6,1,2,3] => [8,7,4,6,5,1,3,2] => ? = 6
[3,2,2,1]
=> [[1,2,3],[4,5],[6,7],[8]]
=> [8,6,7,4,5,1,2,3] => [8,6,7,4,5,1,3,2] => ? = 12
[3,2,1,1,1]
=> [[1,2,3],[4,5],[6],[7],[8]]
=> [8,7,6,4,5,1,2,3] => [8,7,6,4,5,1,3,2] => ? = 20
[3,1,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7],[8]]
=> [8,7,6,5,4,1,2,3] => [8,7,6,5,4,1,3,2] => ? = 6
[2,2,2,2]
=> [[1,2],[3,4],[5,6],[7,8]]
=> [7,8,5,6,3,4,1,2] => [7,8,5,6,3,4,1,2] => ? = 1
[2,2,2,1,1]
=> [[1,2],[3,4],[5,6],[7],[8]]
=> [8,7,5,6,3,4,1,2] => [8,7,5,6,3,4,1,2] => ? = 10
[2,2,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8]]
=> [8,7,6,5,3,4,1,2] => [8,7,6,5,3,4,1,2] => ? = 15
[2,1,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7],[8]]
=> [8,7,6,5,4,3,1,2] => [8,7,6,5,4,3,1,2] => ? = 7
[1,1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7],[8]]
=> [8,7,6,5,4,3,2,1] => [8,7,6,5,4,3,2,1] => ? = 1
[9]
=> [[1,2,3,4,5,6,7,8,9]]
=> [1,2,3,4,5,6,7,8,9] => [1,9,8,7,6,5,4,3,2] => ? = 1
[8,1]
=> [[1,2,3,4,5,6,7,8],[9]]
=> [9,1,2,3,4,5,6,7,8] => [9,1,8,7,6,5,4,3,2] => ? = 2
[7,2]
=> [[1,2,3,4,5,6,7],[8,9]]
=> [8,9,1,2,3,4,5,6,7] => [8,9,1,7,6,5,4,3,2] => ? = 2
[7,1,1]
=> [[1,2,3,4,5,6,7],[8],[9]]
=> [9,8,1,2,3,4,5,6,7] => [9,8,1,7,6,5,4,3,2] => ? = 3
[6,3]
=> [[1,2,3,4,5,6],[7,8,9]]
=> [7,8,9,1,2,3,4,5,6] => [7,9,8,1,6,5,4,3,2] => ? = 2
[6,2,1]
=> [[1,2,3,4,5,6],[7,8],[9]]
=> [9,7,8,1,2,3,4,5,6] => [9,7,8,1,6,5,4,3,2] => ? = 6
[6,1,1,1]
=> [[1,2,3,4,5,6],[7],[8],[9]]
=> [9,8,7,1,2,3,4,5,6] => [9,8,7,1,6,5,4,3,2] => ? = 4
[5,4]
=> [[1,2,3,4,5],[6,7,8,9]]
=> [6,7,8,9,1,2,3,4,5] => [6,9,8,7,1,5,4,3,2] => ? = 2
[5,3,1]
=> [[1,2,3,4,5],[6,7,8],[9]]
=> [9,6,7,8,1,2,3,4,5] => [9,6,8,7,1,5,4,3,2] => ? = 6
[5,2,2]
=> [[1,2,3,4,5],[6,7],[8,9]]
=> [8,9,6,7,1,2,3,4,5] => [8,9,6,7,1,5,4,3,2] => ? = 3
[5,2,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9]]
=> [9,8,6,7,1,2,3,4,5] => [9,8,6,7,1,5,4,3,2] => ? = 12
[5,1,1,1,1]
=> [[1,2,3,4,5],[6],[7],[8],[9]]
=> [9,8,7,6,1,2,3,4,5] => [9,8,7,6,1,5,4,3,2] => ? = 5
Description
The number of permutations with the same antidiagonal sums. The X-ray of a permutation $\pi$ is the vector of the sums of the antidiagonals of the permutation matrix of $\pi$, read from left to right. For example, the permutation matrix of $\pi=[3,1,2,5,4]$ is $$\left(\begin{array}{rrrrr} 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 \end{array}\right),$$ so its X-ray is $(0, 1, 1, 1, 0, 0, 0, 2, 0)$. This statistic records the number of permutations having the same X-ray as the given permutation. In [1] this is called the degeneracy of the X-ray of the permutation. By [prop.1, 1], the number of different X-rays of permutations of size $n$ equals the number of nondecreasing differences of permutations of size $n$, [2].