GreaterNeighborOfMaximum
The larger of the two entries beside n, an end counting as 0.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000060via Permutation✓GreaterNeighborOfMaximum(p)The larger of the two entries beside n, an end counting as 0.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 Sum(Map(
Function(Max([
_x[i - 1] if i > 1 else 0,
_x[i + 1] if i < Length(_x) else 0,
]) if _x[i] == Length(_x) else 0, i),
Range(1, Length(_x)),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |