CyclicMisalignments
Pairs (i, j) with i, p(i), j, p(j) in cyclic order.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001536via Permutation✓CyclicMisalignments(p)Pairs (i, j) with i, p(i), j, p(j) in cyclic order.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) < 1 else Sum(Map(Function(
Count(Filter(
Range(1, Length(_x)),
Function(
i < _x[i] &&
_x[i] < j && j < _x[j] ||
_x[i] < j &&
j < _x[j] && _x[j] < i || j < _x[j] &&
_x[j] < i && i <
_x[i] || _x[j] <
i &&
i <
_x[i] &&
_x[i] <
j,
j,
),
)),
i,
), Range(1, Length(_x))))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |