StandardPermutation

The permutation ranking the letters of the word, equal letters from left to right.

FindStatMp00336via BinaryWord↗

StandardPermutation(BinaryWord)The permutation ranking the letters of the word, equal letters from left to right.

Typed signatures

Type	Package	Applies
(binary_word) -> permutation	combinatorics	always

Domain: Combinatorial maps

Details

• Takes a BinaryWord and returns a Permutation — a typed map, so a wrong carrier is a type error rather than a wrong answer.
• FindStat's Mp00336, Sage's standard_permutation. The image is the Grassmannian permutations, those with at most one descent.

Examples

Basic #

the binary word $01100$

live ↗

In$\mathrm{StandardPermutation}({\operatorname{BinaryWord}}([0, 1, 1, 0, 0]))$Out${\operatorname{Permutation}}([1, 4, 5, 2, 3])$

About

Examples	1
Crosswalk	FindStat