ClockwiseTriangulationRotation from DyckPath
Rotate the triangulation of the (n + 2)-gon the path stands for one step clockwise.
FindStat's Mp00330, the inverse of CounterclockwiseTriangulationRotation. A path is the pre-order walk of the binary tree of the triangulation's faces.
Called as CombinatorialMap(x, "ClockwiseTriangulationRotation"). The head's page has its examples.
Live
Explore
Each element of DyckPath at a size, and its image, applied in your browser; sizes past 7 are not offered.
Properties
Transport a statistic
Pick a statistic on DyckPath. Its distribution over the images of DyckPath at each size is computed, and compared with the 171 statistics on DyckPath: those that share it are the ones the map sends it to, as far as the sizes computed show.
FindStat Mp00330
rotate triangulation clockwise
Matched by value: our map agrees with FindStat's image on each of the 196 rows of size at most 6 we can read (0 unread; its table has 1200 rows).
BijectionGraded mapas FindStat records them, checked by FindStat's contributors.
| Object | Image |
|---|---|
[1,0] | [1,0] |
[1,0,1,0] | [1,1,0,0] |
[1,1,0,0] | [1,0,1,0] |
[1,0,1,0,1,0] | [1,1,0,1,0,0] |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/Mp00330 has the rest.