ValleysIncludingBoundary
Positions lower than both neighbours, a larger entry standing off each end.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000099via Permutation✓ValleysIncludingBoundary(p)Positions lower than both neighbours, a larger entry standing off each end.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. - Excluding the boundary is Valleys.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 1 else Count(Filter(
Range(1, Length(_x)),
Function((True if i == 1 else _x[i - 1] >
_x[i]) &&
(True if i == Length(_x) else _x[i] <
_x[i + 1]), i),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |