Abstract
A strip or a plank S in ℝn is a closed set bounded by two parallel hyperplanes. The distance of these hyperplanes is called the width of S. The minimal width of a convex closed set K is the minimal width of a strip containing K.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Ball, The plank problem in general normed spaces. Manuscript.
T. Bang, A solution of the “Plank problem”. Proc. Amer. Math. Soc. 2 (1951), 990 – 993.
B. Brindza and Zs. Páles, Jelentés az 1985. évi Schweitzer Mikl6s emlékversenyr6l (Report on the 1985 M. Schweitzer memorial competition, in Hungarian). Matematikai Lapok 13 (1982–1986), 149–169.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Basel AG
About this chapter
Cite this chapter
Páles, Z. (1992). On a generalization of the plank problem. In: Walter, W. (eds) General Inequalities 6. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale d’Analyse Numérique, vol 103. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7565-3_44
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7565-3_44
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-7567-7
Online ISBN: 978-3-0348-7565-3
eBook Packages: Springer Book Archive