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