Related papers: A Spiky Ball
The main goal of the paper is to solve some problems about shadow for the sphere generalized on the case of the ellipsoid. Here, the essence of the problem is to find the the minimal number of non-overlapping balls with centers on the…
This purpose of this paper is to prove the following result: let phi be a strictly convex, smooth, convex body in the Euclidean plane, if the intersection of n translates of phi has a non-empty interior, and all of the translates contribute…
The Kelvin problem of an isotropic elastic space subject to a concentrated load is solved in a manner that exploits the problem's built-in symmetries so as to determine in the first place the unique balanced and compatible stress field.
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We motivate then formulate a novel variant of the near-field reflector problem and call it the near-field reflector problem with spatial restrictions. Let $O$ be an anisotropic point source of light and assume that we are given a bounded…
A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…
Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are…
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…
Students in introductory physics courses struggle to understand virtual image formation by a plane mirror and the proper construction of ray diagrams. This difficulty, if not sufficiently addressed, results in further problems throughout…
For each i = 1, ..., n constructions are given for convex bodies K and L in n-dimensional Euclidean space such that each rank i orthogonal projection of K can be translated inside the corresponding projection of L, even though K has…
The minimum $k$-enclosing ball problem seeks the ball with smallest radius that contains at least~$k$ of~$m$ given points in a general $n$-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the…
The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety…
In free-space optical communications and other applications, it is desirable to design optical beams that have reduced or even minimal scintillation. However, the optimization problem for minimizing scintillation is challenging, and few…
Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…
This note constructs sharp obstructions for stabilized symplectic embeddings of an ellipsoid into a ball, in the case when the initial four-dimensional ellipsoid has `eccentricity' of the form 3n-1 for some integer n.
We study symmetrization procedures within the class $\mathcal S_n$ of \emph{ball-bodies}, i.e.\ intersections of unit Euclidean balls (equivalently, summands of the Euclidean unit ball, or $c$-convex sets via the $c$-duality $A\mapsto…
We consider a class of overdetermined problems in rotationally symmetric spaces, which reduce to the classical Serrin's overdetermined problem in the case of the Euclidean space. We prove some general integral identities for rotationally…
The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted area with minimum weighted perimeter. According to Chambers' recent proof of the Log Convex Density Conjecture, for many densities on $\mathbb{R}^n$…
The Busemann-Petty problem asks whether origin-symmetric convex bodies in real Euclidean n-space with smaller central hyperplane sections necessarily have smaller volume. The answer is affirmative for n less or equal to 4 and negative if n…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…