CycleAsOneLinePreimageSize
The permutations whose cycles, each from its least point and in order of those, read p as one word.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000279via Permutation✓CycleAsOneLinePreimageSize(p)The permutations whose cycles, each from its least point and in order of those, read p as one word.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. - A cycle may start at each right-to-left minimum after the first entry, which must be 1.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
1 if Length(_x) < 1 else 2 ^ (Count(Filter(
Range(1, Length(_x)),
Function(_x[i] == Min(Map(
Function(_x[j], j),
Range(i, Length(_x)),
)), i),
)) - 1) if _x[1] == 1 else 0Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |