Lengths of three simple periodic geodesics on a Riemannian $2$-sphere
Bibliographic record
Abstract
Let $M$ be a Riemannian $2$-sphere. A classical theorem of Lyusternik and Shnirelman asserts the existence of three distinct simple non-trivial periodic geodesics on $M$. In this paper we prove that there exist three simple periodic geodesics with lengths that do not exceed $20d$, where $d$ is the diameter of $M$. We also present an upper bound that depends only on the area and diameter for the lengths of the three simple periodic geodesics with positive indices that appear as minimax critical values in the classical proofs of the Lyusternik-Shnirelman theorem. Finally, we present better bounds for these three lengths for "thin" spheres, when the area $A$ is much less than $d^2$, where the bounds for the lengths of the first two simple periodic geodesics are asymptotically optimal, when ${A\over d^2}\longrightarrow 0$.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".