Related papers: Toward finiteness of central configurations for th…
We apply the singular sequence method to investigate the finiteness problem for stationary configurations of the planar N-vortex problem. The initial step of the singular sequence method involves identifying all two-colored diagrams. These…
We provide a computer-assisted proof of the exact count of classes of central configurations for five bodies for several sets of mass values that are exceptional from the point of view of the finiteness results of Albouy and Kaloshin in the…
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…
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…
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 apply the singular sequence method to investigate the finiteness problem for stationary configurations of the planar five-vortex problem. The initial step of the singular sequence method involves identifying all two-colored diagrams.…
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$.…
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…
We consider the finiteness problem for central configurations of the $n-$body problem. We prove that, for $n\geq4$, there exists a (Zariski) closed subset $B$ in the mass space $\mathbb{R}^{n}$, such that if $(m_1,...,m_n) \in…
Central configurations and relative equilibria are an important facet of the study of the $N$-body problem, but become very difficult to rigorously analyze for $N>3$. In this paper we focus on a particular but interesting class of…
In an earlier paper \cite{yu2021Finiteness}, we showed that there are finitely many stationary configurations (consisting of equilibria, rigidly translating configurations, relative equilibria and collapse configurations) in the planar…
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 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 present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…
In this paper we present a complete classification of the isolated central configurations of the five-body problem with equal masses. This is accomplished by using the polyhedral homotopy method to approximate all the isolated solutions of…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We give a new method to attempt to prove that, for a given $n$, there are finitely many equivalence classes of planar central configurations in the Newtonian $n$-body problem for generic masses. The human part of the proof relies on…
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to…
We give a computer assisted proof of the full listing of central configuration for $n$-body problem for Newtonian potential on the plane for $n=5,6,7$ with equal masses. We show all these central configurations have a reflective symmetry…
Planar central configurations can be seen as critical points of the reduced potential or solutions of a system of equations. By the homogeneity and invariance of the potential with respect to SO(2), it is possible to see that the…