Graph explorer

Postorder rearrangement operators

We investigate the rearrangement of the Haar system induced by the postorder on the set of dyadic intervals in $[0,1]$ with length greater than or equal to $2^{-N}$. By means of operator norms on $\text{BMO}_N$ we prove that the postorder has maximal distance to the usual lexicographic order.

3 nodes2 linksoverview mapPostorder rearrangement operators
3 nodes2 links
Postorder rearrangement operators3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWPostorder rearrangement operatorspreprint / 2015AJohanna PentekerResearcherTmath.FA4066 works
PaperSignal 102 links

Postorder rearrangement operators

preprint / 2015

Open