Separation and approximation in normed linear spaces

From MaRDI portal





In an attempt to solve the problem of convexity of Chebyshev sets, \textit{V. Klee} [Math. Ann. 257, 251-260 (1981; Zbl 0453.41021)] initiated a new line of investigation - the approximation from scattered sets of points (i.e. strongly non-convex). The authors show that the existence of ``bad subsets with nice geometric properties forces the space X to behave geometrically badly. For instance if X contains an \(\epsilon\)- discrete Chebyshev set S (i.e. such that \(\| x-y\| \geq \epsilon\) for all x,y\(\in S\), \(x\neq y)\) then X cannot be uniformly nonsquare. They also point out some connections of this problem with packings and tilings (packings which are also coverings of X) in the space X. For the entire collection see [Zbl 0592.00021].











This page was built for publication: Separation and approximation in normed linear spaces

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