Generalized convex sets and the problem of shadow
Khudaiberganov's shadow problem asks: What is the minimum number of pairwise disjoint closed balls, centered on the sphere \(S^{n-1}\) and with radii smaller than one, that guarantees that any straight line passing through the center of the sphere crosses at least one of these balls? Khudaiberganov solved this problem for \(n=2\) (two balls are needed); his proposed solution for \(n>2\) was incorrect. The present paper gives a complete solution to the problem for arbitrary \(n>2\). The authors restate the problem in terms of \(m\)-convex sets. A set \(E \subset \mathbb{R}^n\) is \(m\)-convex with respect to a point \(x\in \mathbb{R}^n \setminus E\) if there exists an \(m\)-dimensional plane \(L\) containing \(x\) such that \(L \cap E=\emptyset\). The set \(E\) is \(m\)-convex if it is \(m\)-convex for every \(x\in \mathbb{R}^n \setminus E\). The smallest \(m\)-convex set containing \(E\) is called the \(m\)-hull of \(E\). The shadow problem can be stated as: What is the minimum number of disjoint closed balls, with centers on a given sphere \(S\) and radii smaller than the radius of \(S\) that guarantees that the center of \(S\) belongs to the 1-hull of the family of balls? The authors prove that \(n+1\) balls are necessary and sufficient (Theorem 2). Next, they generalize the problem to the case of \(m\)-semiconvex sets, and solve it in dimensions \(n=2,3\) (three disks are sufficient in dimension 2, and ten balls in dimension three). The semiconvex version of the shadow problem remains open for \(n>3\).
- Convexity. Selected chapters
- scientific article; zbMATH DE number 996926 (Why is no real title available?)
- scientific article; zbMATH DE number 6115898 (Why is no real title available?)
- scientific article; zbMATH DE number 3665740 (Why is no real title available?)
- scientific article; zbMATH DE number 1865473 (Why is no real title available?)
- scientific article; zbMATH DE number 3228101 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- Problem of shadow (complex case)
- Generalizations of the shadow problem
- More on compacta with convex projections.
- The shadow picture problem for nonintersecting curves
- Topological properties of closed weakly m-semiconvex sets
- Topological and geometric properties of the set of 1-nonconvexity points of a weakly 1-convex set in the plane
- Some generalizations of the shadow problem in the Lobachevsky space
- Problem of shadow in the Lobachevskii space
- The problem of shadow for balls with fixed radius
- The shadow problem for a family of convex sets
- scientific article; zbMATH DE number 1021782 (Why is no real title available?)
- Shadow Problem for the Tangent Bundle of Straight Lines on a Sphere
- scientific article; zbMATH DE number 1820183 (Why is no real title available?)
- On weakly m-convex sets
- Algebraic separation and shadowing of arbitrary sets
- Topological and geometric properties of generalized convex sets and the shadow problem
- Weakly m-convex sets and the shadow problem
- Problem of shadow and surface of constant curvature
- On generalized convex sets and their applications
- Generalized convex envelopes of sets and the problem of shadow
This page was built for publication: Generalized convex sets and the problem of shadow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412909)
