RightOuterPeaks
Peaks of the word p(1) ... p(n) 0: the interior peaks, plus one when p(n) > p(n-1).
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000834via Permutation✓RightOuterPeaks(p)Peaks of the word p(1) ... p(n) 0: the interior peaks, plus one when p(n) > p(n-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.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 2 else Apply((w: list<integer>) => Count(Filter(
Range(
2,
Length(w) -
1,
),
Function(
w[i -
1] <
w[i] &&
w[i] >
w[i +
1],
i,
),
)), Join(
_x,
[0],
))Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Crosswalk | FindStat |