How many translates of a small set are needed to cover the line?

MaRDI QIDQ2496986zbMATH OpenFDO

Authors Ondřej Zindulka

Publication date 26 July 2006

Published in Real Analysis Exchange (Search for Journal in Brave)

zbMATH Keywords

Hausdorff dimensionpacking dimensiontranslatethin set\(\sigma\)-LipschitzMycielski Theorem

Mathematics Subject Classification ID

Hausdorff and packing measures (28A78) Descriptive set theory (03E15)

Recommendations

• Closed sets which consistently have few translations covering the line
• Translates of sequences for some small sets
• On covering by translates of a set
• Covering a Set of Points with a Minimum Number of Lines
• Less than 2^ωmany translates of a compact nullset may cover the real line
• On the maximum number of translates in a point set
• On small line sets with few odd-points
• Are many small sets explicitly small?
• On the minimum number of points covered by a set of lines in \(\mathrm{PG}(2,q)\)
• Covering a set of line segments with a few squares

Cited in

(1)

• Covering \mathbb R with translates of a compact set

This page was built for publication: How many translates of a small set are needed to cover the line?

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