MaximalDiagonalOccupancy
The most entries on one diagonal of the permutation matrix: the largest number of i sharing a p(i) - i.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000887via Permutation✓MaximalDiagonalOccupancy(p)The most entries on one diagonal of the permutation matrix: the largest number of i sharing a p(i) - i.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 Max(Map(
Function(
Count(Filter(
Range(1, Length(_x)),
Function(_x[j] - j ==
_x[i] - i, j),
)),
i,
),
Range(1, Length(_x)),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |