CoarseningCount
The partitions that coarsen this one, whose parts subdivide to give its. Itself included.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000346via IntegerPartition✓CoarseningCount(partition)The partitions that coarsen this one, whose parts subdivide to give its. 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(Apply(
(pw: list<integer>) => Fold(Function(Unique(Map(
Function(Apply(
(cc: integer) => Apply(
(cs: integer) => Apply((cp: integer) => cc -
pw[cs + 1] +
pw[cs + cp +
1] if 0 < cs &&
(cc -
cc %
pw[cs + 1]) /
pw[cs + 1] %
(Sum(_x) + 1) >=
1 else cc +
pw[cp + 1], b),
(e - 1) %
(Sum(_x) + 1),
),
a[1 +
(e - 1 -
(e - 1) %
(Sum(_x) + 1)) /
(Sum(_x) + 1)],
), e),
Range(1, Length(a) *
(Sum(_x) + 1)),
)), a, b), [0], _x),
Fold(
Function(Join(
a,
[a[Length(a)] *
(Sum(_x) + 1)],
), a, b),
[1],
Range(
1,
Sum(_x),
1,
),
),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |