LargestDirectSummandSize
The size of the largest block of p as a direct sum.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000844via Permutation✓LargestDirectSummandSize(p)The size of the largest block of p as a direct sum.Typed signatures
| Type | Package | Applies |
|---|---|---|
(permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutationand 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 Permutation, over _x
0 if Length(_x) < 1 else Apply(
(b: list<integer>) => Max(Map(
Function(b[i + 1] -
b[i], i),
Range(
1,
Length(b) -
1,
1,
),
)),
Join(
[0],
Filter(
Range(1, Length(_x)),
Function(Max(Map(
Function(
_x[j],
j,
),
Range(1, i),
)) == i, i),
),
),
)Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |