Skip to content

Rotation ​

Attach a leaf to the root, remove the leftmost leaf, and let the vertex it hung from become the root.

Rotation(OrderedTree)Attach a leaf to the root, remove the leftmost leaf, and let the vertex it hung from become the root.
Typed signatures
TypePackageApplies
(ordered_tree) -> ordered_treecombinatoricsalways

Domain: Combinatorial maps

Details
  • Takes a OrderedTree and returns a OrderedTree — a typed map, so a wrong carrier is a type error rather than a wrong answer.
  • FindStat's Mp00246, a bijection corresponding to rotating a polygon dissection.

Examples

Basic #

an ordered tree with four edges

live ↗
InRotation(OrderedTree⁡([[[],[]],[]]))\mathrm{Rotation}({\operatorname{OrderedTree}}(\bigl\lbrack\bigl\lbrack\bigl\lbrack\bigr\rbrack, \bigl\lbrack\bigr\rbrack\bigr\rbrack, \bigl\lbrack\bigr\rbrack\bigr\rbrack))OutOrderedTree⁡([[],[[],[]]]){\operatorname{OrderedTree}}(\bigl\lbrack\bigl\lbrack\bigr\rbrack, \bigl\lbrack\bigl\lbrack\bigr\rbrack, \bigl\lbrack\bigr\rbrack\bigr\rbrack\bigr\rbrack)
About
Examples1
CrosswalkFindStat