Toward finiteness of central configurations for the planar six-body problem by symbolic computations. I: Determine diagrams and orders
DOI10.1016/j.jsc.2023.102277OpenAlexW4388773873MaRDI QIDQ6149146
No author found.
Publication date: 5 February 2024
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2023.102277
matrix algebrabicolored graphsingular sequenceasymptotic order matrixtropical/polyhedral geometryzw-diagram
Symbolic computation and algebraic computation (68W30) Applications of graph theory (05C90) Computational methods for problems pertaining to mechanics of particles and systems (70-08) (n)-body problems (70F10) Applications of tropical geometry (14T90)
Cites Work
- Finiteness of spatial central configurations in the five-body problem
- Finiteness of central configurations of five bodies in the plane
- Central configurations with many small masses
- Finiteness of relative equilibria of the four-body problem
- Central configurations in the spatial \(n\)-body problem for \(n=5,6\) with equal masses
- The \(n\)-body problem and mutual distances
- Finiteness and bifurcations of some symmetrical classes of central configurations
- Mathematical problems for the next century
- A continuum of relative equilibria in the five-body problem
- On central configurations
- Finiteness of kite relative equilibria in the five-vortex and five-body problems
- Central configurations in planar \(n\)-body problem with equal masses for \(n=5,6,7\)
- Generic finiteness for a class of symmetric planar central configurations of the six-body problem and the six-vortex problem
- Generic Finiteness for Dziobek Configurations
This page was built for publication: Toward finiteness of central configurations for the planar six-body problem by symbolic computations. I: Determine diagrams and orders