ClockwiseTriangulationRotation

Rotate the triangulation of the (n + 2)-gon the path stands for one step clockwise.

FindStatMp00330via DyckPath↗

ClockwiseTriangulationRotation(DyckPath)Rotate the triangulation of the (n + 2)-gon the path stands for one step clockwise.

Typed signatures

Type	Package	Applies
(dyck_path) -> dyck_path	combinatorics	always

Domain: Combinatorial maps

Details

• Takes a DyckPath and returns a DyckPath — a typed map, so a wrong carrier is a type error rather than a wrong answer.
• FindStat's Mp00330, the inverse of CounterclockwiseTriangulationRotation. A path is the pre-order walk of the binary tree of the triangulation's faces.

Examples

Basic #

the Dyck path $UUDDUD$

live ↗

In$\mathrm{ClockwiseTriangulationRotation}({\operatorname{DyckPath}}([1, 1, 0, 0, 1, 0]))$Out${\operatorname{DyckPath}}([1, 0, 1, 1, 0, 0])$

About

Examples	1
Crosswalk	FindStat