CyclePartition

The orbits, as a set partition of the positions.

FindStatMp00151via Permutation↗

CyclePartition(Permutation)The orbits, as a set partition of the positions.

Typed signatures

Type	Package	Applies
(permutation) -> set_partition	combinatorics	always

Domain: Combinatorial maps

Details

• Takes a Permutation and returns a SetPartition — a typed map, so a wrong carrier is a type error rather than a wrong answer.
• Removed once for giving every position the same label. The cause was the laziness rule in flat.ts — folding over a list taken out of the accumulator instead of indexing a range. Written by index it is right first time.

Examples

Basic #

the one-line word $231$

live ↗

In$\mathrm{CyclePartition}({\operatorname{Permutation}}([2, 3, 1]))$Out${\operatorname{SetPartition}}([[1, 2, 3]])$

About

Examples	1
Crosswalk	FindStat