CyclePeaks
Values i with p^-1(i) < i > p(i).
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000994via Permutation✓CyclePeaks(p)Values i with p^-1(i) < i > p(i).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. - Every cycle has as many peaks as valleys, so this is the cycle valleys too.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 1 else Count(Filter(
Range(1, Length(_x)),
Function(
Sum(Map(
Function(
j if _x[j] ==
i else 0,
j,
),
Range(1, Length(_x)),
)) < i && _x[i] < i,
i,
),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |