pith. sign in

arxiv: 2604.26332 · v1 · submitted 2026-04-29 · 🧮 math.AG · astro-ph.EP

Approximating Periodic Orbits with Algebraic Curves and Related Minimal Problems

Ruiqi Huang , Anton Leykin This is my paper

Pith reviewed 2026-05-07 12:46 UTC · model grok-4.3

classification 🧮 math.AG astro-ph.EP
keywords periodic orbitsalgebraic curvesminimal problemsliaison navigationorbit determinationbranched coveringshomotopy continuationthree-body problem
0
0 comments X

The pith

Periodic orbits in the three-body problem can be approximated by low-degree algebraic curves to enable minimal problems for spacecraft state inference.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a method to approximate families of periodic orbits using low-degree implicit algebraic curves. This produces one-parameter families of algebraic models for the orbits. These models support the construction of minimal problems for inferring spacecraft states from measurements between spacecraft. Such problems arise in applications like initial orbit determination and positioning. The degrees of these problems, which count solutions for generic cases, are computed using symbolic and numerical methods.

Core claim

Approximating a given family of periodic orbits by low-degree implicit algebraic curves produces one-parameter families of algebraic orbit models that enable the construction of minimal problems for liaison navigation applications such as initial orbit determination and spacecraft positioning. For generic parameters the number of solutions equals the degree of the associated branched covering map, which is computed symbolically and numerically. A homotopy-continuation-based solver construction can be practical for low-degree cases.

What carries the argument

Low-degree implicit algebraic curves that approximate periodic orbits and generate families of minimal problems whose solution counts are the degrees of associated branched covering maps.

If this is right

  • One-parameter families of algebraic orbit models are obtained from the approximations.
  • Minimal problems are constructed for inferring spacecraft states from inter-spacecraft measurements.
  • The number of solutions for generic parameters equals the degree of the branched covering map.
  • Degrees of the minimal problems are computed by both symbolic and numerical methods.
  • Homotopy-continuation solvers can be constructed that are practical when the degree is low.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The algebraic models could support faster real-time state estimation in navigation by replacing some numerical integration steps with algebraic solving.
  • Similar approximation techniques might apply to periodic orbits in other dynamical systems with different gravitational configurations.
  • Direct tests could compare the algebraic minimal problems against traditional numerical solvers on shared benchmark instances of orbit determination.

Load-bearing premise

Low-degree implicit algebraic curves can approximate the periodic orbits sufficiently well for the resulting minimal problems to yield practically useful solutions in liaison navigation applications.

What would settle it

Numerical comparison of algebraic curve approximations to high-precision orbit integrations for a range of parameters, or solving sample minimal problems on simulated measurements with known true states to measure recovery accuracy.

Figures

Figures reproduced from arXiv: 2604.26332 by Anton Leykin, Ruiqi Huang.

Figure 1
Figure 1. Figure 1: Inertial (X, Y ) and rotating frame (x, y) in the planar case. The state (x, y, z, x,˙ y,˙ z˙) of the massless body is guided by the equations of motion: x¨ = 2 ˙y + x − (1 − µ)(x + µ) r 3 1 − µ(x − (1 − µ)) r 3 2 , (1) y¨ = −2 ˙x + y − (1 − µ)y r 3 1 − µy r 3 2 , z¨ = − (1 − µ)z r 3 1 − µz r 3 2 , where r 2 1 = (x + µ) 2 + y 2 + z 2 and r 2 2 = (x − (1 − µ))2 + y 2 + z 2 . We imagine the rotating frame sh… view at source ↗
read the original abstract

The Circular Restricted Three-Body Problem (CR3BP) models the motion of a massless body under the gravitational influence of two primaries. We present a method for approximating a given family of periodic orbits by low-degree implicit algebraic curves, producing one-parameter families of algebraic orbit models. These models enable the construction of minimal problems motivated by liaison navigation, where spacecraft states are inferred from inter-spacecraft measurements. Relevant applications include initial orbit determination and spacecraft positioning. Each minimal problem defines a parameterized family of instances; for generic parameters, the number of solutions equals the degree of the associated branched covering map. We compute these degrees using both symbolic and numerical methods, and we outline a homotopy-continuation-based solver construction that can be practical for low-degree cases.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper presents a method for approximating families of periodic orbits in the Circular Restricted Three-Body Problem (CR3BP) by low-degree implicit algebraic curves, yielding one-parameter families of algebraic orbit models. These models are used to construct minimal problems motivated by liaison navigation (e.g., initial orbit determination from inter-spacecraft measurements), where the number of solutions for generic parameters equals the degree of the associated branched covering map. Degrees are computed via both symbolic and numerical algebraic geometry methods, and a homotopy-continuation solver outline is provided for low-degree cases.

Significance. If the algebraic approximations are sufficiently faithful to the underlying dynamics, the work could provide a novel bridge between algebraic geometry and practical astrodynamics, enabling exact algebraic degree counts and potentially efficient solvers for navigation minimal problems. The dual use of symbolic and numerical methods for degree computation is a methodological strength, as is the focus on one-parameter families that preserve the structure needed for branched coverings.

major comments (2)
  1. [Approximation method (around the description of fitting/implicitization and the one-parameter families)] The manuscript provides no quantitative validation of the approximation quality (e.g., maximum pointwise deviation, Hausdorff distance in configuration space, or preservation of orbital period and stability indices) for the low-degree implicit algebraic curves relative to the true CR3BP periodic orbits. This is load-bearing for the central claim that the resulting minimal problems yield practically useful solutions, as large or parameter-dependent errors would mean the computed degrees apply only to the surrogate model.
  2. [Minimal problems section (following the algebraic orbit models)] In the construction of the minimal problems and branched coverings, there is no analysis of how approximation error propagates to the solution set or the degree of the covering map. If the algebraic curves deviate from the true orbits (particularly as the family parameter varies), the generic solution counts may not correspond to physically relevant states in the original dynamical system.
minor comments (2)
  1. [Abstract and introduction] The abstract and introduction could more explicitly state the specific degrees obtained for the example minimal problems and the software/tools used for the symbolic/numerical computations.
  2. [Notation and setup] Notation for the one-parameter families and the branched covering maps could be clarified with a diagram or explicit definition of the parameter space to aid readability for readers outside algebraic geometry.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thoughtful summary and for highlighting two important points regarding validation and error analysis. We agree that these aspects warrant additional attention to strengthen the connection between the algebraic models and their potential use in astrodynamics. We respond to each major comment below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: The manuscript provides no quantitative validation of the approximation quality (e.g., maximum pointwise deviation, Hausdorff distance in configuration space, or preservation of orbital period and stability indices) for the low-degree implicit algebraic curves relative to the true CR3BP periodic orbits. This is load-bearing for the central claim that the resulting minimal problems yield practically useful solutions, as large or parameter-dependent errors would mean the computed degrees apply only to the surrogate model.

    Authors: We agree that the absence of quantitative validation metrics is a limitation for assessing practical utility. The manuscript emphasizes the algebraic construction and degree computations for the surrogate models rather than claiming immediate deployment in navigation. In the revised version we will add a dedicated subsection with quantitative comparisons, including maximum pointwise deviation, Hausdorff distance in configuration space, and verification that orbital periods are preserved to within a small tolerance for representative families. These additions will clarify the fidelity of the low-degree approximations without altering the algebraic results. revision: yes

  2. Referee: In the construction of the minimal problems and branched coverings, there is no analysis of how approximation error propagates to the solution set or the degree of the covering map. If the algebraic curves deviate from the true orbits (particularly as the family parameter varies), the generic solution counts may not correspond to physically relevant states in the original dynamical system.

    Authors: The degrees reported are exact for the branched covering maps defined by the algebraic orbit models themselves. We acknowledge that a detailed propagation analysis of approximation error into the solution sets is missing. Because the degree of a branched covering is stable under small deformations of the curves (for generic parameters and proper maps), the generic counts remain unchanged for sufficiently close surrogates. In revision we will insert a short discussion of this stability together with a qualitative description of how solution sets move continuously with the curves; we will also note that quantitative error propagation for specific navigation instances is best addressed by post-processing with the original dynamics and is left as future work. revision: partial

Circularity Check

0 steps flagged

No circularity: degrees computed via independent external algebraic tools

full rationale

The derivation proceeds by constructing low-degree implicit algebraic approximations to CR3BP periodic orbit families, then defining minimal problems whose generic solution counts equal the degree of the induced branched covering. These degrees are obtained from standard symbolic (e.g., Gröbner bases) and numerical (homotopy continuation) methods in algebraic geometry, which operate on the explicit polynomial systems produced by the construction and do not reduce to any fitted parameter or self-referential definition inside the paper. No self-citation is invoked as a load-bearing uniqueness theorem, no ansatz is smuggled via prior work, and no known empirical pattern is merely renamed. The chain therefore remains self-contained against external computational benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The approach rests on standard algebraic geometry results for computing degrees of maps and numerical continuation techniques; no free parameters, ad-hoc axioms, or invented entities are introduced in the abstract description.

axioms (1)
  • standard math Standard results from algebraic geometry on the degree of branched covering maps
    Invoked to determine the number of solutions for generic parameters in the minimal problems.

pith-pipeline@v0.9.0 · 5420 in / 1167 out tokens · 46005 ms · 2026-05-07T12:46:51.079896+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

2 extracted references · 2 canonical work pages

  1. [1]

    Autonomous Interplanetary Orbit Determination Using Satellite-to-Satellite Tracking

    [Poi92] Henri Poincar´ e.Les m´ ethodes nouvelles de la m´ ecanique c´ eleste. Paris: Gauthier-Villars et fils, 1892. [Sze67] Victor Szebehely.Theory of Orbits: The Restricted Problem of Three Bodies. Academic Press, 1967. [HB07] Keric Hill and George H. Born. “Autonomous Interplanetary Orbit Determination Using Satellite-to-Satellite Tracking”. In:Journal of

    work page 1967

  2. [2]

    Numerical nonlinear algebra

    Guidance, Control, and Dynamics30.3 (2007), pp. 679–686. [Bat+23] Daniel J. Bates et al. “Numerical nonlinear algebra”. In:Combina- torial, Computational, and Applied Algebraic Geometry: A Tribute to Bernd Sturmfels111 (2023), pp. 229–270. [Man+25] Michela Mancini et al. “Geometric solution to the angles-only initial orbit determination problem”. In:The J...

    work page 2007