Toward Finiteness of Central Configurations for the Planar Six-Body Problem by Symbolic Computations. (I) Determine Diagrams and Orders

43 Pages Posted: 7 Apr 2023

See all articles by Kuo-Chang Chen

Kuo-Chang Chen

National Tsing Hua University

Ke-Ming Chang

National Tsing Hua University

Abstract

In a series of papers we develop symbolic computation algorithms to investigate finiteness of central configurations for the planar n-body problem. Our approach is based on Albouy-Kaloshin’s work on finiteness of central configurations for the 5-body problems. In their paper, bicolored graphs called zw-diagrams were introduced for possible scenarios when the finiteness conjecture fails, and proving finiteness amounts to exclusions of central configurations associated to these diagrams. Following their method, the amount of computations becomes enormous when there are more than five bodies. In this paper we introduce matrix algebra for determination of possible diagrams and asymptotic orders, devise several criteria to reduce computational complexity, and determine possible zw-diagrams by automated deductions. For the planar six-body problem, we show that there are at most 86 zw-diagrams.

Keywords: n-body problem, central configuration, symbolic computation

Suggested Citation

Chen, Kuo-Chang and Chang, Ke-Ming, Toward Finiteness of Central Configurations for the Planar Six-Body Problem by Symbolic Computations. (I) Determine Diagrams and Orders. Available at SSRN: https://ssrn.com/abstract=4412743 or http://dx.doi.org/10.2139/ssrn.4412743

Kuo-Chang Chen (Contact Author)

National Tsing Hua University ( email )

No. 101, Section 2, Guangfu Road, East District
Hsin Chu 3, 300
China

Ke-Ming Chang

National Tsing Hua University ( email )

No. 101, Section 2, Guangfu Road, East District
Hsin Chu 3, 300
China

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
38
Abstract Views
149
PlumX Metrics