Postorder rearrangement operators
classification
🧮 math.FA
keywords
postorderrearrangementdistancedyadicequalgreaterhaarinduced
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.