CycleAsOneLineNotation

The cycles, each written from its least point and in order of those points, read as one word.

FindStatMp00090via Permutation↗

CycleAsOneLineNotation(Permutation)The cycles, each written from its least point and in order of those points, read as one word.

Typed signatures

Type	Package	Applies
(permutation) -> permutation	combinatorics	always

Domain: Combinatorial maps

Details

• Takes a Permutation and returns a Permutation — a typed map, so a wrong carrier is a type error rather than a wrong answer.
• FindStat's Mp00090, Sage's cycle_tuples concatenated. Foata's fundamental transformation is the same with the greatest point in front.

Examples

Basic #

the one-line word $231$

live ↗

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

About

Examples	1
Crosswalk	FindStat