How many translates of a small set are needed to cover the line? (Q2496986)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How many translates of a small set are needed to cover the line? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How many translates of a small set are needed to cover the line? |
scientific article |
Statements
How many translates of a small set are needed to cover the line? (English)
0 references
26 July 2006
0 references
This is an abstract of the lecture given during the XXIXth Summer Symposium in Real Analysis, San Bernardino, 2005. The author considers the question of what subsets of the real line are thin. A set \(A\subset{\mathbb R}\) is thin if less than continuum many translates of \(A\) cannot cover \(\mathbb R\). A review of contemporary history of this question is presented. Some new results are annouced (without proofs and details). A few open problems are posed.
0 references
thin set
0 references
translate
0 references
packing dimension
0 references
Hausdorff dimension
0 references
\(\sigma\)-Lipschitz
0 references
Mycielski Theorem
0 references
0.80608416
0 references
0 references
0.7663841
0 references
0.7638033
0 references
0.7616799
0 references
0 references
0 references
0.7549519
0 references
0.75453573
0 references