ContainingRectangleShortSide

The shorter side of the smallest rectangle that contains the diagram: the smaller of the largest part and the number of parts.

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

ContainingRectangleShortSide(partition)The shorter side of the smallest rectangle that contains the diagram: the smaller of the largest part and the number of parts.

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

0 if Length(_x) < 1 else Min(Max(_x), Length(_x))

Examples

Basic #

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

live ↗

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

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

live ↗

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

Properties #

FindStat's value for [1]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{IntegerPartition}}([1]), \text{ContainingRectangleShortSide})$Out$1$

Known value · FindStat St000533

FindStat's value for [2]

live ↗

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

Known value · FindStat St000533

FindStat's value for [3]

live ↗

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

Known value · FindStat St000533

About

Examples	5
Crosswalk	FindStat