We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/The method of loop molecules and the topology of the Kovalevskaya top
PeriodicalsMathematics

The method of loop molecules and the topology of the Kovalevskaya top

Checking your access to this record.

Abstract & Overview

The topology of the Liouville foliation in the phase space of the Kovalevskaya top is completely characterized. It involves ve distinct families of tori which are separated by 14 types of bifurcations. The bifurcations are organized by 13 dierent singularities, six of which are relative equilibria, and seven degenerate critical orbits. The bare molecules for the ten types of isoenergy surfaces have been determined earlier, but important information about the connection between admissible coordinate systems at dierent bifurcations has been missing so far. This gap is lled with the computation of marked molecules, based on a new method which uses molecules corresponding to loops around singular points in the bifurcation diagram. A global set of admissible coordinates is identied, and the molecules of all isoenergy surfaces are endowed with gluing matrices and topological marks.

Cite this record

Alexey V. Bolsinov, Peter Hinnerk Richter, Anatoly Timofeevich Fomenko (2000). The method of loop molecules and the topology of the Kovalevskaya top. Sbornik Mathematics, 191(2), 151–188. https://doi.org/10.1070/sm2000v191n02abeh000451

Copy in another style

Bolsinov, A. V., Richter, P. H., & Fomenko, A. T. (2000). The method of loop molecules and the topology of the Kovalevskaya top. Sbornik Mathematics, 191(2), 151–188. https://doi.org/10.1070/sm2000v191n02abeh000451
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.