Less than 2/omega many translates of a compact nullset may cover the real line
Marton Elekes
Abstract
We answer a question of Darji and Keleti by proving in ZFC that there exists a compact nullset C0⊂ such that for every perfect set P⊂ there exists x∈ such that (C0+x) P is uncountable. Using this C0 we answer a question of Gruenhage by showing that it is consistent with ZFC that less than 2ω many translates of a compact nullset cover .
Create a lesson
Related papers
Linear-exponent bounds for the automatic complexity of rational diagonals modulo prime powers
Alex Shvets
How Does One Cut a 30-60-90 Triangle?
Ed Pegg, Brian Trease, Andrew Hudson et al.
A Computational Verification of the Markov Uniqueness Conjecture for z≤ 10500000
Hu Tan, Ying Zhang
On Some Special Cases of the Weber-Schafheitlin Integral
V. G. Zborovskii
Harborth's theorem p(5)=18 revisited
Mike Winkler
Bernstein and Stieltjes properties of some functions involving logarithmic functions
Feng Qi