searching the database
Your data matches 7 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001529
St001529: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 1
[2]
=> 5
[1,1]
=> 4
[3]
=> 37
[2,1]
=> 55
[1,1,1]
=> 23
[4]
=> 405
[3,1]
=> 587
[2,2]
=> 284
[2,1,1]
=> 712
[1,1,1,1]
=> 206
[5]
=> 5251
[4,1]
=> 7501
[3,2]
=> 7151
[3,1,1]
=> 8949
[2,2,1]
=> 8719
[2,1,1,1]
=> 10103
[1,1,1,1,1]
=> 2247
Description
The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition.
In other words, it is the sum of the coefficients in
$$(-1)^{|\lambda|-\ell(\lambda)}\nabla p_\lambda \vert_{q=1,t=1},$$
when expanded in the monomial basis.
Here, $\nabla$ is the linear operator on symmetric functions
where the modified Macdonald polynomials are eigenvectors. See the Sage documentation for definition and references [[http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/sf/sfa.html]]
Matching statistic: St000103
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00001: Alternating sign matrices —to semistandard tableau via monotone triangles⟶ Semistandard tableaux
St000103: Semistandard tableaux ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00001: Alternating sign matrices —to semistandard tableau via monotone triangles⟶ Semistandard tableaux
St000103: Semistandard tableaux ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Values
[1]
=> [1,0]
=> [[1]]
=> [[1]]
=> 1
[2]
=> [1,0,1,0]
=> [[1,0],[0,1]]
=> [[1,1],[2]]
=> 4
[1,1]
=> [1,1,0,0]
=> [[0,1],[1,0]]
=> [[1,2],[2]]
=> 5
[3]
=> [1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [[1,1,1],[2,2],[3]]
=> ? ∊ {23,37,55}
[2,1]
=> [1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [[1,1,1],[2,3],[3]]
=> ? ∊ {23,37,55}
[1,1,1]
=> [1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [[1,1,2],[2,3],[3]]
=> ? ∊ {23,37,55}
[4]
=> [1,0,1,0,1,0,1,0]
=> [[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]]
=> ? ∊ {206,284,405,587,712}
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [[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]]
=> ? ∊ {206,284,405,587,712}
[2,2]
=> [1,1,1,0,0,0]
=> [[0,0,1],[0,1,0],[1,0,0]]
=> [[1,2,3],[2,3],[3]]
=> ? ∊ {206,284,405,587,712}
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [[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]]
=> ? ∊ {206,284,405,587,712}
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [[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]]
=> ? ∊ {206,284,405,587,712}
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[1,1,1,1,1],[2,2,2,2],[3,3,3],[4,4],[5]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [[1,1,1,1,1],[2,2,2,2],[3,3,3],[4,5],[5]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [[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]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,1,1,1,1],[2,2,2,2],[3,3,4],[4,5],[5]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [[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]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,1,1,1,1],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,1,1,1,2],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103}
Description
The sum of the entries of a semistandard tableau.
Matching statistic: St001684
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St001684: Permutations ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St001684: Permutations ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Values
[1]
=> [1,0]
=> [[1],[2]]
=> [2,1] => 1
[2]
=> [1,0,1,0]
=> [[1,3],[2,4]]
=> [2,4,1,3] => 4
[1,1]
=> [1,1,0,0]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 5
[3]
=> [1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [2,4,6,1,3,5] => ? ∊ {23,37,55}
[2,1]
=> [1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [2,5,6,1,3,4] => ? ∊ {23,37,55}
[1,1,1]
=> [1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> [3,5,6,1,2,4] => ? ∊ {23,37,55}
[4]
=> [1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> [2,4,6,8,1,3,5,7] => ? ∊ {206,284,405,587,712}
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [2,4,7,8,1,3,5,6] => ? ∊ {206,284,405,587,712}
[2,2]
=> [1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => ? ∊ {206,284,405,587,712}
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [2,5,7,8,1,3,4,6] => ? ∊ {206,284,405,587,712}
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [[1,2,4,6],[3,5,7,8]]
=> [3,5,7,8,1,2,4,6] => ? ∊ {206,284,405,587,712}
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9],[2,4,6,8,10]]
=> [2,4,6,8,10,1,3,5,7,9] => ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[1,3,5,7,8],[2,4,6,9,10]]
=> [2,4,6,9,10,1,3,5,7,8] => ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [2,6,7,8,1,3,4,5] => ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[1,3,5,6,8],[2,4,7,9,10]]
=> [2,4,7,9,10,1,3,5,6,8] => ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> [4,5,7,8,1,2,3,6] => ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[1,3,4,6,8],[2,5,7,9,10]]
=> [2,5,7,9,10,1,3,4,6,8] => ? ∊ {2247,5251,7151,7501,8719,8949,10103}
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[1,2,4,6,8],[3,5,7,9,10]]
=> [3,5,7,9,10,1,2,4,6,8] => ? ∊ {2247,5251,7151,7501,8719,8949,10103}
Description
The reduced word complexity of a permutation.
For a permutation $\pi$, this is the smallest length of a word in simple transpositions that contains all reduced expressions of $\pi$.
For example, the permutation $[3,2,1] = (12)(23)(12) = (23)(12)(23)$ and the reduced word complexity is $4$ since the smallest words containing those two reduced words as subwords are $(12),(23),(12),(23)$ and also $(23),(12),(23),(12)$.
This statistic appears in [1, Question 6.1].
Matching statistic: St000525
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
Mp00262: Binary words —poset of factors⟶ Posets
St000525: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
Mp00262: Binary words —poset of factors⟶ Posets
St000525: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Values
[1]
=> 10 => 10 => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 1 + 2
[2]
=> 100 => 010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> 6 = 4 + 2
[1,1]
=> 110 => 110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 7 = 5 + 2
[3]
=> 1000 => 0010 => ([(0,2),(0,3),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,5),(8,5),(8,6)],9)
=> ? ∊ {23,37,55} + 2
[2,1]
=> 1010 => 0110 => ([(0,2),(0,3),(1,5),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,6),(8,5)],9)
=> ? ∊ {23,37,55} + 2
[1,1,1]
=> 1110 => 1110 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> ? ∊ {23,37,55} + 2
[4]
=> 10000 => 00010 => ([(0,3),(0,4),(1,2),(1,11),(2,8),(3,9),(3,10),(4,1),(4,9),(4,10),(6,7),(7,5),(8,5),(9,6),(10,6),(10,11),(11,7),(11,8)],12)
=> ? ∊ {206,284,405,587,712} + 2
[3,1]
=> 10010 => 00110 => ([(0,3),(0,4),(1,9),(2,6),(2,11),(3,2),(3,10),(3,12),(4,1),(4,10),(4,12),(6,7),(7,5),(8,5),(9,8),(10,6),(11,7),(11,8),(12,9),(12,11)],13)
=> ? ∊ {206,284,405,587,712} + 2
[2,2]
=> 1100 => 1010 => ([(0,1),(0,2),(1,6),(1,7),(2,6),(2,7),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5)],8)
=> ? ∊ {206,284,405,587,712} + 2
[2,1,1]
=> 10110 => 01110 => ([(0,3),(0,4),(1,2),(1,10),(1,11),(2,8),(2,9),(3,6),(3,7),(4,1),(4,6),(4,7),(6,11),(7,10),(8,5),(9,5),(10,8),(11,9)],12)
=> ? ∊ {206,284,405,587,712} + 2
[1,1,1,1]
=> 11110 => 11110 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10)
=> ? ∊ {206,284,405,587,712} + 2
[5]
=> 100000 => 000010 => ([(0,4),(0,5),(1,3),(1,12),(2,11),(3,2),(3,14),(4,10),(4,13),(5,1),(5,10),(5,13),(7,8),(8,9),(9,6),(10,7),(11,6),(12,8),(12,14),(13,7),(13,12),(14,9),(14,11)],15)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[4,1]
=> 100010 => 000110 => ([(0,4),(0,5),(1,11),(2,1),(2,13),(3,7),(3,14),(4,2),(4,12),(4,16),(5,3),(5,12),(5,16),(7,8),(8,9),(9,6),(10,6),(11,10),(12,7),(13,11),(13,15),(14,8),(14,15),(15,9),(15,10),(16,13),(16,14)],17)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[3,2]
=> 10100 => 10010 => ([(0,2),(0,3),(1,5),(1,9),(2,10),(2,11),(3,1),(3,10),(3,11),(5,7),(6,8),(7,4),(8,4),(9,7),(9,8),(10,5),(10,6),(11,6),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[3,1,1]
=> 100110 => 001110 => ([(0,4),(0,5),(1,12),(2,3),(2,13),(2,16),(3,8),(3,14),(4,1),(4,9),(4,15),(5,2),(5,9),(5,15),(7,10),(8,11),(9,13),(10,6),(11,6),(12,7),(13,8),(14,10),(14,11),(15,12),(15,16),(16,7),(16,14)],17)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[2,2,1]
=> 11010 => 10110 => ([(0,2),(0,3),(1,5),(1,9),(2,10),(2,11),(3,1),(3,10),(3,11),(5,7),(6,8),(7,4),(8,4),(9,7),(9,8),(10,5),(10,6),(11,6),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[2,1,1,1]
=> 101110 => 011110 => ([(0,4),(0,5),(1,3),(1,7),(1,8),(2,13),(2,14),(3,2),(3,11),(3,12),(4,9),(4,10),(5,1),(5,9),(5,10),(7,12),(8,11),(9,8),(10,7),(11,13),(12,14),(13,6),(14,6)],15)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[1,1,1,1,1]
=> 111110 => 111110 => ([(0,2),(0,6),(1,8),(2,7),(3,5),(3,9),(4,3),(4,11),(5,1),(5,10),(6,4),(6,7),(7,11),(9,10),(10,8),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
Description
The number of posets with the same zeta polynomial.
The zeta polynomial $Z$ is the polynomial such that $Z(m)$ is the number of weakly increasing sequences $x_1\leq x_2\leq\dots\leq x_{m−1}$ of elements of the poset.
See section 3.12 of [1].
Since
$$
Z(q) = \sum_{k\geq 1} \binom{q-2}{k-1} c_k,
$$
where $c_k$ is the number of chains of length $k$, this statistic is the same as the number of posets with the same chain polynomial.
Matching statistic: St001406
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00082: Standard tableaux —to Gelfand-Tsetlin pattern⟶ Gelfand-Tsetlin patterns
St001406: Gelfand-Tsetlin patterns ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00082: Standard tableaux —to Gelfand-Tsetlin pattern⟶ Gelfand-Tsetlin patterns
St001406: Gelfand-Tsetlin patterns ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Values
[1]
=> [1,0]
=> [[1],[2]]
=> [[1,1],[1]]
=> 3 = 1 + 2
[2]
=> [1,0,1,0]
=> [[1,3],[2,4]]
=> [[2,2,0,0],[2,1,0],[1,1],[1]]
=> 7 = 5 + 2
[1,1]
=> [1,1,0,0]
=> [[1,2],[3,4]]
=> [[2,2,0,0],[2,1,0],[2,0],[1]]
=> 6 = 4 + 2
[3]
=> [1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [[3,3,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {23,37,55} + 2
[2,1]
=> [1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {23,37,55} + 2
[1,1,1]
=> [1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> [[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[2,1,0],[2,0],[1]]
=> ? ∊ {23,37,55} + 2
[4]
=> [1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> [[4,4,0,0,0,0,0,0],[4,3,0,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {206,284,405,587,712} + 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [[4,4,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {206,284,405,587,712} + 2
[2,2]
=> [1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> [[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> ? ∊ {206,284,405,587,712} + 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [[4,4,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {206,284,405,587,712} + 2
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [[1,2,4,6],[3,5,7,8]]
=> [[4,4,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[2,1,0],[2,0],[1]]
=> ? ∊ {206,284,405,587,712} + 2
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9],[2,4,6,8,10]]
=> [[5,5,0,0,0,0,0,0,0,0],[5,4,0,0,0,0,0,0,0],[4,4,0,0,0,0,0,0],[4,3,0,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[1,3,5,7,8],[2,4,6,9,10]]
=> [[5,5,0,0,0,0,0,0,0,0],[5,4,0,0,0,0,0,0,0],[5,3,0,0,0,0,0,0],[4,3,0,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [[4,4,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[4,1,0,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[1,3,5,6,8],[2,4,7,9,10]]
=> [[5,5,0,0,0,0,0,0,0,0],[5,4,0,0,0,0,0,0,0],[5,3,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> [[4,4,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[1,3,4,6,8],[2,5,7,9,10]]
=> [[5,5,0,0,0,0,0,0,0,0],[5,4,0,0,0,0,0,0,0],[5,3,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[1,2,4,6,8],[3,5,7,9,10]]
=> [[5,5,0,0,0,0,0,0,0,0],[5,4,0,0,0,0,0,0,0],[5,3,0,0,0,0,0,0],[4,3,0,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[2,1,0],[2,0],[1]]
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 2
Description
The number of nonzero entries in a Gelfand Tsetlin pattern.
Matching statistic: St000104
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
Mp00262: Binary words —poset of factors⟶ Posets
St000104: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
Mp00262: Binary words —poset of factors⟶ Posets
St000104: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Values
[1]
=> 10 => 10 => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 1 + 5
[2]
=> 100 => 010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> 10 = 5 + 5
[1,1]
=> 110 => 110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 4 + 5
[3]
=> 1000 => 0010 => ([(0,2),(0,3),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,5),(8,5),(8,6)],9)
=> ? ∊ {23,37,55} + 5
[2,1]
=> 1010 => 0110 => ([(0,2),(0,3),(1,5),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,6),(8,5)],9)
=> ? ∊ {23,37,55} + 5
[1,1,1]
=> 1110 => 1110 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> ? ∊ {23,37,55} + 5
[4]
=> 10000 => 00010 => ([(0,3),(0,4),(1,2),(1,11),(2,8),(3,9),(3,10),(4,1),(4,9),(4,10),(6,7),(7,5),(8,5),(9,6),(10,6),(10,11),(11,7),(11,8)],12)
=> ? ∊ {206,284,405,587,712} + 5
[3,1]
=> 10010 => 00110 => ([(0,3),(0,4),(1,9),(2,6),(2,11),(3,2),(3,10),(3,12),(4,1),(4,10),(4,12),(6,7),(7,5),(8,5),(9,8),(10,6),(11,7),(11,8),(12,9),(12,11)],13)
=> ? ∊ {206,284,405,587,712} + 5
[2,2]
=> 1100 => 1010 => ([(0,1),(0,2),(1,6),(1,7),(2,6),(2,7),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5)],8)
=> ? ∊ {206,284,405,587,712} + 5
[2,1,1]
=> 10110 => 01110 => ([(0,3),(0,4),(1,2),(1,10),(1,11),(2,8),(2,9),(3,6),(3,7),(4,1),(4,6),(4,7),(6,11),(7,10),(8,5),(9,5),(10,8),(11,9)],12)
=> ? ∊ {206,284,405,587,712} + 5
[1,1,1,1]
=> 11110 => 11110 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10)
=> ? ∊ {206,284,405,587,712} + 5
[5]
=> 100000 => 000010 => ([(0,4),(0,5),(1,3),(1,12),(2,11),(3,2),(3,14),(4,10),(4,13),(5,1),(5,10),(5,13),(7,8),(8,9),(9,6),(10,7),(11,6),(12,8),(12,14),(13,7),(13,12),(14,9),(14,11)],15)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[4,1]
=> 100010 => 000110 => ([(0,4),(0,5),(1,11),(2,1),(2,13),(3,7),(3,14),(4,2),(4,12),(4,16),(5,3),(5,12),(5,16),(7,8),(8,9),(9,6),(10,6),(11,10),(12,7),(13,11),(13,15),(14,8),(14,15),(15,9),(15,10),(16,13),(16,14)],17)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[3,2]
=> 10100 => 10010 => ([(0,2),(0,3),(1,5),(1,9),(2,10),(2,11),(3,1),(3,10),(3,11),(5,7),(6,8),(7,4),(8,4),(9,7),(9,8),(10,5),(10,6),(11,6),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[3,1,1]
=> 100110 => 001110 => ([(0,4),(0,5),(1,12),(2,3),(2,13),(2,16),(3,8),(3,14),(4,1),(4,9),(4,15),(5,2),(5,9),(5,15),(7,10),(8,11),(9,13),(10,6),(11,6),(12,7),(13,8),(14,10),(14,11),(15,12),(15,16),(16,7),(16,14)],17)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[2,2,1]
=> 11010 => 10110 => ([(0,2),(0,3),(1,5),(1,9),(2,10),(2,11),(3,1),(3,10),(3,11),(5,7),(6,8),(7,4),(8,4),(9,7),(9,8),(10,5),(10,6),(11,6),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[2,1,1,1]
=> 101110 => 011110 => ([(0,4),(0,5),(1,3),(1,7),(1,8),(2,13),(2,14),(3,2),(3,11),(3,12),(4,9),(4,10),(5,1),(5,9),(5,10),(7,12),(8,11),(9,8),(10,7),(11,13),(12,14),(13,6),(14,6)],15)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[1,1,1,1,1]
=> 111110 => 111110 => ([(0,2),(0,6),(1,8),(2,7),(3,5),(3,9),(4,3),(4,11),(5,1),(5,10),(6,4),(6,7),(7,11),(9,10),(10,8),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
Description
The number of facets in the order polytope of this poset.
Matching statistic: St000151
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
Mp00262: Binary words —poset of factors⟶ Posets
St000151: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
Mp00262: Binary words —poset of factors⟶ Posets
St000151: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 17%●distinct values known / distinct values provided: 17%
Values
[1]
=> 10 => 10 => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6 = 1 + 5
[2]
=> 100 => 010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> 10 = 5 + 5
[1,1]
=> 110 => 110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 9 = 4 + 5
[3]
=> 1000 => 0010 => ([(0,2),(0,3),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,5),(8,5),(8,6)],9)
=> ? ∊ {23,37,55} + 5
[2,1]
=> 1010 => 0110 => ([(0,2),(0,3),(1,5),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,6),(8,5)],9)
=> ? ∊ {23,37,55} + 5
[1,1,1]
=> 1110 => 1110 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> ? ∊ {23,37,55} + 5
[4]
=> 10000 => 00010 => ([(0,3),(0,4),(1,2),(1,11),(2,8),(3,9),(3,10),(4,1),(4,9),(4,10),(6,7),(7,5),(8,5),(9,6),(10,6),(10,11),(11,7),(11,8)],12)
=> ? ∊ {206,284,405,587,712} + 5
[3,1]
=> 10010 => 00110 => ([(0,3),(0,4),(1,9),(2,6),(2,11),(3,2),(3,10),(3,12),(4,1),(4,10),(4,12),(6,7),(7,5),(8,5),(9,8),(10,6),(11,7),(11,8),(12,9),(12,11)],13)
=> ? ∊ {206,284,405,587,712} + 5
[2,2]
=> 1100 => 1010 => ([(0,1),(0,2),(1,6),(1,7),(2,6),(2,7),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5)],8)
=> ? ∊ {206,284,405,587,712} + 5
[2,1,1]
=> 10110 => 01110 => ([(0,3),(0,4),(1,2),(1,10),(1,11),(2,8),(2,9),(3,6),(3,7),(4,1),(4,6),(4,7),(6,11),(7,10),(8,5),(9,5),(10,8),(11,9)],12)
=> ? ∊ {206,284,405,587,712} + 5
[1,1,1,1]
=> 11110 => 11110 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10)
=> ? ∊ {206,284,405,587,712} + 5
[5]
=> 100000 => 000010 => ([(0,4),(0,5),(1,3),(1,12),(2,11),(3,2),(3,14),(4,10),(4,13),(5,1),(5,10),(5,13),(7,8),(8,9),(9,6),(10,7),(11,6),(12,8),(12,14),(13,7),(13,12),(14,9),(14,11)],15)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[4,1]
=> 100010 => 000110 => ([(0,4),(0,5),(1,11),(2,1),(2,13),(3,7),(3,14),(4,2),(4,12),(4,16),(5,3),(5,12),(5,16),(7,8),(8,9),(9,6),(10,6),(11,10),(12,7),(13,11),(13,15),(14,8),(14,15),(15,9),(15,10),(16,13),(16,14)],17)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[3,2]
=> 10100 => 10010 => ([(0,2),(0,3),(1,5),(1,9),(2,10),(2,11),(3,1),(3,10),(3,11),(5,7),(6,8),(7,4),(8,4),(9,7),(9,8),(10,5),(10,6),(11,6),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[3,1,1]
=> 100110 => 001110 => ([(0,4),(0,5),(1,12),(2,3),(2,13),(2,16),(3,8),(3,14),(4,1),(4,9),(4,15),(5,2),(5,9),(5,15),(7,10),(8,11),(9,13),(10,6),(11,6),(12,7),(13,8),(14,10),(14,11),(15,12),(15,16),(16,7),(16,14)],17)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[2,2,1]
=> 11010 => 10110 => ([(0,2),(0,3),(1,5),(1,9),(2,10),(2,11),(3,1),(3,10),(3,11),(5,7),(6,8),(7,4),(8,4),(9,7),(9,8),(10,5),(10,6),(11,6),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[2,1,1,1]
=> 101110 => 011110 => ([(0,4),(0,5),(1,3),(1,7),(1,8),(2,13),(2,14),(3,2),(3,11),(3,12),(4,9),(4,10),(5,1),(5,9),(5,10),(7,12),(8,11),(9,8),(10,7),(11,13),(12,14),(13,6),(14,6)],15)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
[1,1,1,1,1]
=> 111110 => 111110 => ([(0,2),(0,6),(1,8),(2,7),(3,5),(3,9),(4,3),(4,11),(5,1),(5,10),(6,4),(6,7),(7,11),(9,10),(10,8),(11,9)],12)
=> ? ∊ {2247,5251,7151,7501,8719,8949,10103} + 5
Description
The number of facets in the chain polytope of the poset.
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!