着色并元区间的支撑树重排、同构与组合
Rearrangements with supporting Trees, Isomorphisms and Combinatorics of coloured dyadic Intervals
摘要：
我们确定一类重排，承认一个支持树。这个条件意味着相关的重排算子有一个有界的向量值扩张。证明了$L^p$存在一个大的子空间，在这个子空间上有界重排算子充当同构。这些问题的组合问题产生了一个两人对策，要发挥彩色二进间隔。我们为每个参与者确定获胜策略。
英文摘要：
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 $L^p$ 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
