On coverings of convex sets by translates of slabs
HTML articles powered by AMS MathViewer
- by H. Groemer PDF
- Proc. Amer. Math. Soc. 82 (1981), 261-266 Request permission
Abstract:
Let $({S_1},{S_2}, \ldots )$ be a sequence of slabs in euclidean $n$-dimensional space and let ${t_i}$ denote the thickness of ${S_i}$. It is shown that the condition $\sum {t_i^{(n + 1)/2} = \infty }$ implies that every convex set can be covered by translates of the slabs ${S_i}$, and that the exponent $(n + 1)/2$ is, in a certain sense, best possible.References
- H. Groemer, On coverings of plane convex sets by translates of strips, Aequationes Math. 22 (1981), no. 2-3, 215–222. MR 645420, DOI 10.1007/BF02190181
- A. D. Wyner, Capabilities of bounded discrepancy decoding, Bell System Tech. J. 44 (1965), 1061–1122. MR 180417, DOI 10.1002/j.1538-7305.1965.tb04170.x
Additional Information
- © Copyright 1981 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 82 (1981), 261-266
- MSC: Primary 52A45
- DOI: https://doi.org/10.1090/S0002-9939-1981-0609663-7
- MathSciNet review: 609663