EdgeOrbitCount
Orbits of the complete graph's edges under a permutation with these cycle lengths: the sum of half the parts rounded down, plus the sum of gcd(part, part) over pairs.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001982via IntegerPartition✓EdgeOrbitCount(partition)Orbits of the complete graph's edges under a permutation with these cycle lengths: the sum of half the parts rounded down, plus the sum of gcd(part, part) over pairs.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(Map(
Function((_x[i] - _x[i] % 2) / 2, i),
Range(1, Length(_x)),
)) + Sum(Map(Function(Sum(Map(
Function(
_x[i] *
_x[j] /
LCM(
_x[i],
_x[j],
) if j <
i else 0,
j,
),
Range(
1,
Length(_x),
),
)), i), Range(
1,
Length(_x),
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |