SetPartitionsWithBlockSizesCount
The number of set partitions whose block sizes are the parts: the size factorial over the product of the factorials of the parts and of the multiplicities.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000049via IntegerPartition✓SetPartitionsWithBlockSizesCount(partition)The number of set partitions whose block sizes are the parts: the size factorial over the product of the factorials of the parts and of the multiplicities.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
1 if Length(_x) < 1 else (1 if Sum(_x) == 0 else Product(Range(1, Sum(_x)))) /
(Product(Map(Function(
1 if _x[i] == 0 else Product(Range(1, _x[i])),
i,
), Range(1, Length(_x)))) *
Product(Map(
Function(Count(Filter(
Range(1, i),
Function(_x[j] ==
_x[i], j),
)), i),
Range(1, Length(_x)),
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |