RimHooksRemovedToTwoCore
The 2-rim hooks removed to reach the 2-core: the size less the core's, over 2, the core read off the abacus.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000698via IntegerPartition✓RimHooksRemovedToTwoCore(partition)The number of 2-rim hooks removed to reach the 2-core: the size less the core's, over 2. The core's size is read off the abacus, from how many beads sit on each runner.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
0 if Length(_x) < 1 else (Sum(_x) - (Sum(Map(
Function(Count(Filter(
Range(
1,
Length(_x),
),
Function((_x[i] +
(Length(_x) - i)) %
2 ==
r, i),
)) *
(r + 2 * (Count(Filter(
Range(1, Length(_x)),
Function((_x[i] +
(Length(_x) - i)) %
2 ==
r, i),
)) -
1) / 2), r),
Range(0, 1),
)) - Length(_x) * (Length(_x) - 1) /
2)) / 2Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |