DominatedPartitionCount
The partitions of the same size that this one dominates (partial sums of the parts at least those of the other), itself included.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000321via IntegerPartition✓DominatedPartitionCount(partition)The partitions of the same size that this one dominates (partial sums of the parts at least those of the other), itself included.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 Apply(
(w: list<integer>) => Sum(w),
Fold(
Function(Map(Function(Map(
Function(Sum(Map(
Function(a[r - c +
1][d], d),
Range(c, Sum(_x) + 1, 1),
)) if c <= r &&
r - 1 <=
Sum(Map(
Function(_x[q] if q <= Length(_x) else 0, q),
Range(1, b, 1),
)) else 0, c),
Range(
1,
Sum(_x) +
1,
),
), r), Range(
1,
Sum(_x) +
1,
)), a, b),
Map(Function(Map(
Function(
1 if r == 1 &&
c == Sum(_x) +
1 else 0,
c,
),
Range(1, Sum(_x) + 1),
), r), Range(
1,
Sum(_x) + 1,
)),
Range(1, Sum(_x)),
)[Sum(_x) + 1],
)Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |