Skip to content

TamariDyckPath from BinaryTree ​

The Dyck path T(L) U T(R) D of a tree with subtrees L and R: the bijection compatible with the Tamari order.

BinaryTree → DyckPathbijectioninverse

FindStat's Mp00020; the inverse is TamariBinaryTree. DyckPath(BinaryTree) reads the other decomposition, U T(L) D T(R), so this is it after a left-right mirror and a reverse-complement.

Called as CombinatorialMap(x, "TamariDyckPath"). The head's page has its examples.

Live

Explore

Each element of BinaryTree at a size, and its image, applied in your browser; sizes past 6 are not offered.

Properties

Transport a statistic

Pick a statistic on DyckPath. Its distribution over the images of BinaryTree at each size is computed, and compared with the 37 statistics on BinaryTree: those that share it are the ones the map sends it to, as far as the sizes computed show.

FindStat Mp00020

to Tamari-corresponding Dyck path

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.

Return the Dyck path associated with a binary tree in consistency with the Tamari order on Dyck words and binary trees.
ObjectImage
[.,.][1,0]
[.,[.,.]][1,1,0,0]
[[.,.],.][1,0,1,0]
[.,[.,[.,.]]][1,1,1,0,0,0]

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/Mp00020 has the rest.