Some Enumeration Problems on Central Configurations at the Bifurcation Points

In “Counting central configurations at the bifurcation points,” we proposed an algorithm to rigorously count central configurations in some cases that involve one parameter. Here, we improve our algorithm to consider three harder cases: the planar (3+1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(3+1)$\end{document}-body problem with two equal masses; the planar 4-body problem with two pairs of equal masses which have an axis of symmetry containing one pair of them; the spatial 5-body problem with three equal masses at the vertices of an equilateral triangle and two equal masses on the line passing through the center of the triangle and being perpendicular to the plane containing it.