DescentBottomWord

Letter v is 1 when value v is a descent bottom: some larger value immediately precedes it.

FindStatMp00131via Permutation↗

DescentBottomWord(Permutation)Letter v is 1 when value v is a descent bottom: some larger value immediately precedes it.

Typed signatures

Type	Package	Applies
(permutation) -> binary_word	combinatorics	always

Domain: Combinatorial maps

Details

• Takes a Permutation and returns a BinaryWord — a typed map, so a wrong carrier is a type error rather than a wrong answer.
• Value n is never a descent bottom, so the last letter stands for n - 1.

Examples

Basic #

the one-line word $231$

live ↗

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

About

Examples	1
Crosswalk	FindStat