Combinatorics of dyadic intervals: consistent colourings

DOI10.4064/BA62-2-1MaRDI QIDQ2926664zbMATH OpenOpenAlexFDO

Authors Anna Kamont, Paul F. X. Müller

Publication date 3 November 2014

Published in Bulletin of the Polish Academy of Sciences, Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.2161

zbMATH Keywords

2-person gamescoloured dyadic intervalsconsistent and homogeneous colouring

Mathematics Subject Classification ID

Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15) 2-person games (91A05)

Abstract: We study the problem of consistent and homogeneous colourings for increasing families of dyadic intervals. We determine when this problem can be solved and when not.

Cites work

• BMO and the Banach Space Approximation Problem
• Carleson measures and the Fefferman-Stein decomposition of BMO\((\mathbb{R})\)
• Compensated compactness, separately convex functions and interpolatory estimates between Riesz transforms and Haar projections
• Continuous rearrangements of the Haar system in H_pfor 0 < p < ∞
• scientific article; zbMATH DE number 3626044 (Why is no real title available?)
• scientific article; zbMATH DE number 4122617 (Why is no real title available?)
• Rearrangements of the Haar System that Preserve BMO
• Rearrangements with supporting trees, isomorphisms and shift operators
• Topics in Harmonic Analysis Related to the Littlewood-Paley Theory. (AM-63)

Cited in

(2)

• Colouring relatives of intervals on the plane. II: Intervals and rays in two directions
• scientific article; zbMATH DE number 5911916 (Why is no real title available?)

This page was built for publication: Combinatorics of dyadic intervals: consistent colourings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926664)