Related papers: A comprehensive analysis of the Snellius-Pothenot …
For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…
This paper presents a study of the isosceles problem resulting by a perturbation of Euler's collinear solution under Newtonian gravitational attraction of three bodies in space. After the Hamiltonian was obtained, a circumference of…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
The three-dimensional linear regression problem is a problem of finding a spacial straight line best fitting a group of points in three-dimensional Euclidean space. This problem is considered in the present paper and a solution to it is…
The classical H. Poincar\'{e} Center-Focus problem asks about the characterization of planar polynomial vector fields such that all their integral trajectories are closed curves whose interiors contain a fixed point, a {\em center}. This…
The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…
A perfect cuboid (PC) is a rectangular parallelepiped with rational sides $a,b,c$ whose face diagonals $d_{ab}$, $d_{bc}$, $d_{ac}$ and space (body) diagonal $d_s$ are rationals. The existence or otherwise of PC is a problem known since at…
Consider n=2l>=4 point particles with equal masses in space, subject to the following symmetry constraint: at each instant they form an orbit of the dihedral group D_l, where D_l is the group of order 2l generated by two rotations of angle…
We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…
We solve the problem of finding a sharp upper bound on the minimum angle formed by $N$ points in the Euclidean and Hyperbolic planes.
We discuss the general three-particle quantum scattering problem, for motion restricted to the full line. Specifically, we formulate the three-body problem in one dimension in terms of the (Faddeev-type) integral equation approach. As a…
It is classically known that a real cubic surface in the real projective 3-space cannot have more than one solitary point (locally given by x^2+y^2+z^2=0) whereas it can have up to four nodes (x^2+y^2-z^2=0). We show that on any surface of…
Given two distinct point sets $P$ and $Q$ in the plane, we say that $Q$ \emph{blocks} $P$ if no two points of $P$ are adjacent in any Delaunay triangulation of $P\cup Q$. Aichholzer et al. (2013) showed that any set $P$ of $n$ points in…
We study analytic surfaces in 3-dimensional Euclidean space containing two circular arcs through each point. The problem of finding such surfaces traces back to the works of Darboux from XIXth century. We reduce finding all such surfaces to…
In Euclidean geometry the circle of Apollonious is the locus of points in the plane from which two collinear adjacent segments are perceived as having the same length. In Hyperbolic geometry, the analog of this locus is an algebraic curve…
The point-plane incidence theorem states that the number of incidences between $n$ points and $m\geq n$ planes in the projective three-space over a field $F$, is $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear…
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…
An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…
We suggest a method of solving the problem of existence of a triangle with prescribed two bisectors and one third element which can be taken as one of the angles, the sides, the heights or the medians, or the third bisector.
We study colorings of the hyperbolic plane, analogously to the Hadwiger-Nelson problem for the Euclidean plane. The idea is to color points using the minimum number of colors such that no two points at distance exactly $d$ are of the same…