WeakExceedancePartition

The coarsest set partition containing every arc from i to π(i) with i ≤ π(i).

FindStatMp00240via Permutation↗

WeakExceedancePartition(Permutation)The coarsest set partition containing every arc from i to π(i) with i ≤ π(i).

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.
• FindStat's Mp00240, the weak exceedance partition. Not injective.

Examples

Basic #

the one-line word $231$

live ↗

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

About

Examples	1
Crosswalk	FindStat