DistinctParts
How many distinct part sizes occur.
✓ checked against that system · ! checked, with disagreements (hover a chip)Wikipedia
Integer partitionMathWorldPartitionWikidataQ1082910Britannicatopic/partition-of-an-integerOEISA000009FindStatSt000903via IntegerComposition✓St000159via IntegerPartition✓St001453via PlanePartition✓DistinctParts(partition)How many distinct part sizes occur.Typed signatures
| Type | Package | Applies |
|---|---|---|
(composition | integer_partition | plane_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 Count(Filter(
Range(1, Max(_x)),
Function(Count(Filter(
Range(
1,
Length(_x),
),
Function(_x[i] ==
j, i),
)) > 0, j),
))on IntegerComposition, over _x
Length(Unique(_x))on PlanePartition, over _x
0 if Length(Flatten(_x)) < 1 else Apply((reading: list<integer>) => Apply(
(lengths: list<integer>) => Max(Sum(Map(Function(1 if Max(Sum(Map(Function(1 if e == k else 0, e), reading)), 0) >
0 else 0, k), Range(1, Max(reading), 1))), 0),
Map(
Function(Length(r), r),
_x,
),
), Flatten(_x))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | WikipediaMathWorldWikidataBritannicaOEISFindStat ×3 |