Combinatorics of Dyadic Intervals: Consistent Colorings
Functional Analysis
2014-09-09 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1409.2161,
title = {Combinatorics of Dyadic Intervals: Consistent Colorings},
author = {Anna Kamont and Paul F. X. Muller},
journal= {arXiv preprint arXiv:1409.2161},
year = {2014}
}
Comments
arXiv admin note: text overlap with arXiv:0909.4926