Related papers: Collinearities in Kinetic Point Sets
We generalize the Newtonian n-body problem to spaces of curvature k=constant, and study the motion in the 2-dimensional case. For k>0, the equations of motion encounter non-collision singularities, which occur when two bodies are antipodal.…
Classically the kinetic theory for a perfect gas has zero spatial number density correlation between separate points because the particles are independent. But the joint spatial and temporal correlation is non-zero (and easily calculable)…
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…
A $k$-crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we present two statements on crossing families which are based on…
We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{5/2}} + \frac{n}{k} \right)$, and…
Let $p_1,p_2,p_3$ be three non-collinear points in the plane, and let $P$ be a set of $n$ other points in the plane. We show that the number of distinct distances between $p_1,p_2,p_3$ and the points of $P$ is $\Omega(n^{6/11})$, improving…
Continuing work initiated in an earlier publication [Yamada, Asada, Phys. Rev. D 82, 104019 (2010)], we investigate collinear solutions to the general relativistic three-body problem. We prove the uniqueness of the configuration for given…
Andr\'e's celebrated Theorem of 1998 implies that each complex straight line (apart from obvious exceptions) contains at most finitely many points whose both coordinates are j-invariants of elliptic curves with complex multiplication. We…
A bottleneck plane perfect matching of a set of $n$ points in $\mathbb{R}^2$ is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as {\em bottleneck}. The…
The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first…
A well-known theorem in plane geometry states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite metric spaces,…
We show that for any set of $n$ points moving along "simple" trajectories (i.e., each coordinate is described with a polynomial of bounded degree) in $\Re^d$ and any parameter $2 \le k \le n$, one can select a fixed non-empty subset of the…
In 1951, Gabriel Dirac conjectured that every set P of n non-collinear points in the plane contains a point in at least n/2-c lines determined by P, for some constant c. The following weakening was proved by Beck and Szemer\'edi-Trotter:…
The internal space for a molecule, atom, or other n-body system can be conveniently parameterised by 3n-9 kinematic angles and three kinematic invariants. For a fixed set of kinematic invariants, the kinematic angles parameterise a…
We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…
In this paper, we consider a planar dynamical system with a piecewise linear function containing an arbitrary number (but finite) of dropping sections and approximating some continuous nonlinear function. Studying all possible local and…
The point sets of all known optimal rectilinear drawings of $K_n$ share an unmistakeable clustering property, the so--called {\em 3--decomposability}. It is widely believed that the underlying point sets of all optimal rectilinear drawings…
Consider the following problem: how many collinear triples of points must a transversal of (Z/nZ)^2 have? This question is connected with venerable issues in discrete geometry. We show that the answer, for n prime, is between (n-1)/4 and…
If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…
In this paper we characterize all the solutions of the three body problem on which one body with mass $m_1$ remains in a fixed line and the other two bodies have the same mass $m_2$. We show that all the solutions with negative total energy…