DistinctSubsetSums
Distinct sums of non-empty sub-multisets of the parts.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000548via IntegerPartition✓DistinctSubsetSums(partition)Distinct sums of non-empty sub-multisets of the parts.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. - Follows FindStat's Sage code and its data, not its title: the "partial sums" it counts are the sums of arbitrary sub-multisets of the parts (the code runs over all subsets), not of the running prefixes.
Definition
Epsil, as the implementation runs it.
on IntegerPartition, over _x
0 if Length(_x) < 1 else Apply(
(s: collection) => Length(s) - 1,
Fold(Function(Unique(Join(
a,
Map(Function(
i + b,
i,
), a),
)), a, b), [0], _x),
)Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |