MaximalSuccessiveDifference
The largest p(i+1) - p(i), negative for a decreasing permutation.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000652via Permutation✓MaximalSuccessiveDifference(p)The largest p(i+1) - p(i), negative for a decreasing permutation.Typed signatures
| Type | Package | Applies |
|---|---|---|
(list<integer> | permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutation, and also a bare list of integers: this reading compares entries with each other rather than with their positions, so it stands on any sequence. - MaximalRiseSize is the same with a floor of 0.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 2 else Max(Map(
Function(_x[i + 1] - _x[i], i),
Range(1, Length(_x) - 1),
))Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Crosswalk | FindStat |