Related papers: Algorithm for planar 4-Body Problem central config…
An interesting description of a collinear configuration of four particles is found in terms of two spherical coordinates. An algorithm to compute the four coordinates of particles of a collinear Four-Body central configuration is presented…
The plane case of central configurations with four different masses is analyzed theoretically and is computed numerically. We follow Dziobek's approach to four body central configurations with a direct implicit method of our own in which…
We study central configurations in the four body problem, i.e., configurations in which the forces on all the bodies point to a fixed, single point in space. The newly formulated pair-space formalism yields a set of vectorial equations that…
A new coordinate system is defined for the Four-Body dynamical problem with general masses, having as its origin of coordinates the center of mass. The transformation from the inertial coordinate system involves a combination of a rotation…
In this work we are interested in the central configurations of the spatial seven-body problem where six of them are at vertices of two congruents equilateral triangles belong to parallel planes and one triangle is a rotation by the angle…
In the studied axisymmetric case of the central four-body problem, the axis of symmetry is defined by two unequal-mass bodies, while the other two bodies are situated symmetrically with respect to this axis and have equal masses. Here, we…
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 systematically investigate properties of various triangle centers (such as orthocenter or incenter) located on the four faces of a tetrahedron. For each of six types of tetrahedra, we examine over 100 centers located on the four faces of…
A stochastic optimization algorithm for analyzing planar central and balanced configurations in the $n$-body problem is presented. We find a comprehensive list of equal mass central configurations satisfying the Morse equality up to $n=12$.…
Two numerical algorithms for analyzing planar central and balanced configurations in the $(n+1)$-body problem with a small mass are presented. The first one relies on a direct solution method of the $(n+1)$-body problem by using a…
We present a computer assisted proof of the full listing of central configurations for spatial n-body problem for n = 5 and 6, with equal masses. For each central configuration we give a full list of its euclidean symmetries. For all masses…
We consider the equilibria of point particles under the action of two body central forces in which there are both repulsive and attractive interactions, often known as central configurations, with diverse applications in physics, in…
A system of N points, each having mass m, and a central mass M forming a planar central configuration, is considered. The equations of motion of a test particle are given and compared using different coordinates. For large values of N, even…
A symmetric planar central configuration of the Newtonian six-body problem $x$ is called cross central configuration if there are precisely four bodies on a symmetry line of $x$. We use complex algebraic geometry and Groebner basis theory…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
We discuss several conditions for four points to lie on a plane, and we use them to find new equations for four-body central configurations that use angles as variables. We use these equations to give novel proofs of some results for…
In this paper, we give an algorithm to infer the positions of the vertices of an unknown tetrahedron, given a sample of points which are uniformly distributed within the tetrahedron. The accuracy of the algorithm is demonstrated using some…
The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…
We consider the motion of point masses given by a natural extension of Newtonian gravitation to spaces of constant positive curvature. Our goal is to explore the spectral stability of tetrahedral orbits of the corresponding 4-body problem…
The degeneracy of central configurations in the planar $N$-body problem makes their enumeration problem hard and the related dynamics appealing. To truly understand the bifurcations of central configurations, we should work in the FULL…