Related papers: Generalized problem of Apollonius
Nandakumar asked whether there is a tiling of the plane by pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker result is obtained: there is a tiling of the plane by pairwise non-congruent triangles of equal…
We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…
Traditionally, the P3P problem is solved by firstly transforming its 3 quadratic equations into a quartic one, then by locating the roots of the resulting quartic equation and verifying whether a root does really correspond to a true…
We provide infinitely many solutions of a Dirichlet problem on balls.
This work studies circle-geometry methods through their application to a main theorem about circles tangent twice to a conic. The authors investigate the Sharygin point -- a point lying in the pencil of two non-intersecting circles -- and…
We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…
A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…
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…
We describe a construction of plane quartics with prescribed Galois operation on the 28 bitangents, in the particular case of a Galois invariant Cayley octad. As an application, we solve the inverse Galois problem for degree two del Pezzo…
In this paper, we consider a time-periodically forced Kepler problem in any dimensions, with an external force which we only assume to be regular in a neighborhood of the attractive center. We prove that there exist infinitely many periodic…
The infinite spin problem concerns the rotational behavior of total collision orbits in the $n$-body problem. It has long been known that when a solution tends to total collision then its normalized configuration curve must converge to the…
In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
The Plurality problem - introduced by Aigner \cite{A2004} - has many variants. In this article we deal with the following version: suppose we are given $n$ balls, each of them colored by one of three colors. A \textit{plurality ball} is one…
We consider a Kepler problem in dimension two or three, with a time-dependent $T$-periodic perturbation. We prove that for any prescribed positive integer $N$, there exist at least $N$ periodic solutions (with period $T$) as long as the…
We study caustics of an elliptical paraboloid and the history of their various representations from 3D models in XIX century to the recent computer graphics. In the paper two ways of generating the surface, one with cartesian coordinates…
We generalize the Cannonball Problem by introducing integer-valued and non-increasing arithmetic functions $w$. We associate these functions $w$ with certain polygons, which we call cannonball polygons. Through this correspondence, we show…
An old theorem, due to Graustein, asserts that the average curvature of a plane oval is attained at least at four points. We present a proof by way of wave propagation and extend this result to the spherical and hyperbolic geometries - in…
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.
This paper discusses a problem that consists of $n$ "lighthouses" which are circles with radius 1, placed around a common center, equidistant at $n$ units away from the placement center. Consecutive lighthouses are separated by the same…