2000 character limit reached
On the trajectories of O(1)-Kepler Problems
Published 25 Nov 2014 in math-ph and math.MP | (1411.7068v3)
Abstract: The trajectories of the $\mathrm{O}(1)$-Kepler problem at level $n\ge 2$ are completely determined. It is found in particular that a non-colliding trajectory is an ellipse, a parabola or a branch of hyperbola according as the total energy is negative, zero or positive. Moreover, it is shown that the group $\mathrm{GL}(n, \mathbb R)/\mathrm{O}(1)$ acts transitively on both the set of oriented elliptic trajectories and the set of oriented parabolic trajectories. The method employed here is similar to the one used by Levi-Civita in the study of planar Kepler problem in 1920.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.