Rearrangements with supporting Trees, Isomorphisms and Combinatorics of coloured dyadic Intervals
Functional Analysis
2009-09-29 v1
Abstract
We determine a class of rearrangements that admit a supporting tree. This condition implies that the associated rearrangement operator has a bounded vector valued extension. We show that there exists a large subspace of on which a bounded rearrangement operator acts as an isomorphism. The combinatorial issues of these problems give rise to a two-person game, to be played with colored dyadic intervals. We determine winning strategies for each of the players.
Keywords
Cite
@article{arxiv.0909.4926,
title = {Rearrangements with supporting Trees, Isomorphisms and Combinatorics of coloured dyadic Intervals},
author = {Anna Kamont and Paul F. X. Mueller},
journal= {arXiv preprint arXiv:0909.4926},
year = {2009}
}