SemistandardTableauCountWithEntriesUpToTwo

Semistandard tableaux of the shape with entries at most 2: the product of 2 + j - i over the cells, over the hook product.

✓ checked against that system · ! checked, with disagreements (hover a chip)FindStatSt000714via IntegerPartition✓↗

SemistandardTableauCountWithEntriesUpToTwo(partition)The number of semistandard tableaux of the shape with entries at most 2: the product of 2 + j - i over the cells, over the hook product.

Typed signatures

Type	Package	Applies
(integer_partition) -> number	combinatorics	always

Domain: Partition statistics

Details

• Defined over IntegerPartition as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a IntegerPartition and nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer.

Definition

Epsil, as the implementation runs it.

on IntegerPartition, over _x

1 if Length(_x) < 1 else 0 if Length(_x) > 2 else Product(Map(
                                                               Function(Product(Map(
                                                                                     Function(2 +
                                                                                              (j - i), j),
                                                                                     Range(1, _x[i]),
                                                                                   )), i),
                                                               Range(
                                                                      1,
                                                                      Length(_x),
                                                                    ),
                                                             )) / Product(Map(
                                                                              Function(Product(Map(Function(_x[i] - j +
                                                                                                            (Map(Function(Count(Filter(
                                                                                                                                        Range(1, Length(_x)),
                                                                                                                                        Function(_x[j] >= i, j),
                                                                                                                                      )), i), Range(1, Max(_x)))[j] -
                                                                                                             i) +
                                                                                                            1, j), Range(1, _x[i]))), i),
                                                                              Range(1, Length(_x)),
                                                                            ))

Examples

Basic #

the partition $4 + 2 + 1$ of $7$

live ↗

In$\mathrm{SemistandardTableauCountWithEntriesUpToTwo}({\operatorname{IntegerPartition}}([4, 2, 1]))$Out$0$

the partition $3 + 3 + 1$ of $7$

live ↗

In$\mathrm{SemistandardTableauCountWithEntriesUpToTwo}({\operatorname{IntegerPartition}}([3, 3, 1]))$Out$0$

Properties #

FindStat's value for [2]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{IntegerPartition}}([2]), \text{SemistandardTableauCountWithEntriesUpToTwo})$Out$3$

Known value · FindStat St000714

FindStat's value for [3]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{IntegerPartition}}([3]), \text{SemistandardTableauCountWithEntriesUpToTwo})$Out$4$

Known value · FindStat St000714

FindStat's value for [4]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{IntegerPartition}}([4]), \text{SemistandardTableauCountWithEntriesUpToTwo})$Out$5$

Known value · FindStat St000714

About

Examples	5
Crosswalk	FindStat