RefinementCount
The partitions that refine this one, whose parts subdivide to give theirs. Itself included.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000345via IntegerPartition✓RefinementCount(partition)The partitions that refine this one, whose parts subdivide to give theirs. 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 1 if Sum(_x) < 2 else Length(Fold(
Function(Unique(Join(
a,
Map(
Function(Apply(
(mc: integer) => Apply(
(sj: integer) => Apply(
(sa: integer) => mc -
((Sum(_x) + 1) ^
sj -
((Sum(_x) + 1) ^
sa +
(Sum(_x) + 1) ^
(sj - sa))) if 2sa <= sj &&
(mc -
mc %
(Sum(_x) + 1) ^
sj) /
(Sum(_x) + 1) ^
sj %
(Sum(_x) + 1) >=
1 else mc,
1 +
(e - 1) %
(Sum(_x) - 1) ^
2 %
(Sum(_x) - 1),
),
2 +
((e - 1) %
(Sum(_x) - 1) ^
2 -
(e - 1) %
(Sum(_x) - 1) ^
2 %
(Sum(_x) - 1)) /
(Sum(_x) - 1),
),
a[1 +
(e - 1 -
(e - 1) %
(Sum(_x) - 1) ^
2) /
(Sum(_x) - 1) ^
2],
), e),
Range(1, Length(a) *
(Sum(_x) - 1) ^
2),
),
)), a, b),
[Sum(Map(
Function((Sum(_x) + 1) ^
_x[i], i),
Range(
1,
Length(_x),
),
))],
Range(
1,
Sum(_x) - 1,
1,
),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |