Related papers: Four classic problems
Classical Borsuk problem asks about the minimal number of closed subsets of smaller diameter necessary to partition every compact in the Euclidean space. Topological version of the Borsuk problem is discussed.
In geometry, there are several challenging problems studying numbers associated to convex bodies. For example, the packing density problem, the kissing number problem, the covering density problem, the packing-covering constant problem,…
Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…
Let a number, N, of particles interact classically through Newton's Laws of Motion and Newton's inverse square Law of Gravitation. The resulting equations of motion provide an approximate mathematical model with numerous applications in…
The classical Busemann-Petty problem (1956) asks, whether origin-symmetric convex bodies in $\mathbb {R}^n$ with smaller hyperplane central sections necessarily have smaller volumes. It is known, that the answer is affirmative if $n\le 4$…
We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation numbers and prove a few relations between the…
We introduce a restricted four body problem in a 2+2 configuration extending the classical Sitnikov problem to the Double Sitnikov problem. The secondary bodies are moving on the same perpendicular line to the planewhere the primaries…
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. Since then, this problem and its analogues have been studied by many authors, including $\mathrm{B\acute{a}r\acute{a}ny}$, Lagarias, Pach,…
We consider a symmetric five-body problem with three unequal collinear masses on the axis of symmetry. The remaining two masses are symmetrically placed on both sides of the axis of symmetry. Regions of possible central configurations are…
We consider the Tarski--Bang problem about covering of convex bodies by planks. The results of this kind give a lower bound on the sum of widths of planks (regions between a pair of parallel hyperplanes) covering a given convex body.…
In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…
In this article we encode Hadwiger's covering conjecture and Borsuk's partition conjecture into continuous functions defined on the spaces of convex bodies, propose a four-step program to approach them, and obtain some partial results.
The problem of three particles interacting through harmonic forces is discussed within the Newtonian formalism. By means of a didactic approach, an exact analytical solution is found, and ways to extend it to the N-body case are pointed…
Given a symmetric convex body $C$ and $n$ hyperplanes in an Euclidean space, there is a translate of a multiple of $C$, at least ${1\over n+1}$ times as large, inside $C$, whose interior does not meet any of the hyperplanes. The result…
By using some simple tools from graph theory, we obtain a characterization of the planar convex bodies with Borsuk number equal to two. This result allows to give some examples of planar convex bodies with Borsuk number equal to three.…
If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We address an old open question in convex geometry that dates back to the work of Minkowski: what are the equality cases of the monotonicity of mixed volumes? The problem is equivalent to that of providing a geometric characterization of…
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…
We explain the solution of the following two problems: obtaining of Kepler's laws from Newton's laws (so called two bodies problem) and obtaining the fourth Newton's law (the formula for gravitation) as a corollary of Kepler's laws. This…