Related papers: Exploring a planet, revisited
A deep-space exploration mission with low-thrust propulsion to rendezvous with multiple asteroids is investigated. Indirect methods, based on the optimal control theory, are implemented to optimize the fuel consumption. The application of…
The aim of this paper is to generalize Apollonius' problem. The problem is to construct a circle that is tangent to three given circles in a plane. We find the maximum possible number of solution circles in the case of more than the three…
We study the polynomial optimization problem of minimizing a multihomogeneous polynomial over the product of spheres. This polynomial optimization problem models the tensor optimization problem of finding the best rank one approximation of…
The problem of (non)random distribution of points on sphere and in space is investigated. The procedure for obtaining preferred direction (and plane) for points on the sphere (in the sky) and in the space is discussed. At present,…
Using the universal torsor method due to Salberger, we study the approximation of a general fixed point by rational points on split toric varieties. We prove that under certain geometric hypothesis the best approximations (in the sense of…
The Tomas-Stein inequality for a compact subset $\Gamma$ of the sphere $S^d$ states that the mapping $f\mapsto \widehat{f\sigma}$ is bounded from $L^2(\Gamma,\sigma)$ to $L^{2+4/d}(\R^{d+1})$. Then conditional on a strict comparison between…
In this paper we prove the Kneser-Poulsen conjecture for the case of large radii. Namely, if a finite number of points in Euclidean space $E^n$ is rearranged so that the distance between each pair of points does not decrease, then there…
This article sketches the proofs of two theorems about sphere packings in Euclidean 3-space. The first is K. Bezdek's strong dodecahedral conjecture: the surface area of every bounded Voronoi cell in a packing of balls of radius 1 is at…
The paper reports a generalized expression for filling the congruent circles (of radius r) in a circle (of radius R). First, a generalized expression for the biggest circle (r) inscribed in the nth part of the bigger circle (R) was…
We study the problem of maximizing the minimal value over the sphere $S^{d-1}\subset \mathbb R^d$ of the potential generated by a configuration of $d+1$ points on $S^{d-1}$ (the maximal discrete polarization problem). The points interact…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
Consider an arrangement of $n$ congruent zones on the $d$-dimensional unit sphere $S^{d-1}$, where a zone is the intersection of an origin symmetric Euclidean plank with $S^{d-1}$. We prove that, for sufficiently large $n$, it is possible…
We consider the problem of two interacting particles on a sphere. The potential of the interaction depends on the distance between the particles. The case of Newtonian-type potentials is studied in most detail. We reduce this system to a…
Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally…
We propose that the eccentricity and sharpness of the edge of Fomalhaut's disk are due to a planet just interior to the ring edge. The collision timescale consistent with the disk opacity is long enough that spiral density waves cannot be…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
In [1], the author considered the problem of the optimal approximation of symmetric surfaces by biquadratic B\'ezier patches. Unfortunately, the results therein are incorrect, which is shown in this paper by considering the optimal…
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…
According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…
Consider n points on the unit 2-sphere. The potential of the interaction of two points is a function f(r) of the distance r between the points. The total energy E of n points is the sum of the pairwise energies. The question is how to place…