Recoils
Values i with i + 1 to the left of i: the descents of the inverse.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000354via Permutation✓Recoils(p)Values i with i + 1 to the left of i: the descents of the inverse.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.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 2 else Count(Filter(
Range(1, Length(_x) - 1),
Function(Sum(Map(Function(
j if _x[j] ==
i else 0,
j,
), Range(
1,
Length(_x),
))) >
Sum(Map(Function(
j if _x[j] ==
i + 1 else 0,
j,
), Range(
1,
Length(_x),
))), i),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |