TwoCycleCount
Cycles of size exactly two.
TwoCycleCount(p)Cycles of size exactly two.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 Count(Filter(Map(
Function(Min(Filter(
Range(
1,
Length(_x),
1,
),
Function(Fold(
Function(_x[w], w, j),
i,
Range(1, k, 1),
) ==
i, k),
)), i),
Filter(
Range(1, Length(_x), 1),
Function(Fold(
Function(
w if w <= 0 else 0 if w == i else -1 if w < i else _x[w],
w,
k,
),
_x[i],
Range(
1,
Length(_x),
1,
),
) == 0, i),
),
), Function(c == 2, c)))Examples
About
| Examples | 2 |
|---|