LongestSuccessionRun
The length of the longest factor p(k), ..., p(l) with p(i+1) = p(i) + 1.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001652via Permutation✓LongestSuccessionRun(p)The length of the longest factor p(k), ..., p(l) with p(i+1) = p(i) + 1.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. - FindStat's St001662 reads the same, but its code miscounts runs that restart after a gap, so only St001652 is matched.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 1 else Fold(Function(
[Max([a[1], a[2] + 1]), a[2] + 1, b] if b ==
a[3] + 1 else [Max([a[1], 1]), 1, b],
a,
b,
), [0, 0, 0], _x)[1]Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Crosswalk | FindStat |