Construction of points realizing the regular systems of Wolfgang Schmidt and Leonard Summerer
Bibliographic record
Abstract
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>ℝ</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:math> , and find new ones. Given a point in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>ℝ</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:math> , they first show how most of its exponents of Diophantine approximation can be computed in terms of the successive minima of a parametric family of convex bodies attached to that point. Then they prove that these successive minima can in turn be approximated by a certain class of functions which they call <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mi>γ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> -systems. In this way, they bring the whole problem to the study of these functions. To complete the theory, one would like to know if, conversely, given an <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mi>γ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> -system, there exists a point in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>ℝ</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:math> whose associated family of convex bodies has successive minima which approximate that function. In the present paper, we show that this is true for a class of functions which they call regular systems.
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.004 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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".