MinimalSubpartitionSizeDifference
The smallest difference in size between the two halves of a split of the parts into two sub-multisets.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000835via IntegerPartition✓MinimalSubpartitionSizeDifference(partition)The smallest difference in size between the two halves of a split of the parts into two sub-multisets.Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer_partition) -> number | combinatorics | always |
Details
- Defined over
IntegerPartitionas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
IntegerPartitionand 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 Apply(
(s: list<integer>) => Min(Map(
Function(i * 2 -
Sum(_x), i),
Filter(
s,
Function(i * 2 >=
Sum(_x), i),
),
)),
Fold(Function(Unique(Join(
a,
Map(Function(
i + b,
i,
), a),
)), a, b), [0], _x),
)Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |