MétaCan
Menu
Back to cohort
Record W4387673935 · doi:10.1090/bull/1811

Missing digits and good approximations

2023· article· en· W4387673935 on OpenAlexafffund
Andrew Granville

Bibliographic record

VenueBulletin of the American Mathematical Society · 2023
Typearticle
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsUniversité de Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAlgorithmAnnotationComputer scienceArtificial intelligenceType (biology)Machine learningDatabaseGeology

Abstract

fetched live from OpenAlex

James Maynard has taken the analytic number theory world by storm in the last decade, proving several important and surprising theorems, resolving questions that had seemed far out of reach. He is perhaps best known for his work on small and large gaps between primes (which were discussed, hot off the press, in our 2015 <italic>Bulletin of the AMS</italic> article). In this article we will discuss two other Maynard breakthroughs: — Mersenne numbers take the form <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2 Superscript n Baseline minus 1"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:msup> <mml:mo> − </mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">2^n-1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and so appear as <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="111 ellipsis 111"> <mml:semantics> <mml:mrow> <mml:mn>111</mml:mn> <mml:mo> … </mml:mo> <mml:mn>111</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">111\dots 111</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in base 2, having no digit “ <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="0"> <mml:semantics> <mml:mn>0</mml:mn> <mml:annotation encoding="application/x-tex">0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ”. It is a famous conjecture that there are infinitely many such primes. More generally it was, until Maynard’s work, an open question as to whether there are infinitely many primes that miss any given digit, in any given base. We will discuss Maynard’s beautiful ideas that went into his 2019 partial resolution of this question. — In 1926, Khinchin gave remarkable conditions for when real numbers can usually be “well approximated” by infinitely many rationals. However Khinchin’s theorem regarded 1/2, 2/4, 3/6 as distinct rationals and so could not be easily modified to cope, say, with approximations by fractions with prime denominators. In 1941 Duffin and Schaeffer proposed an appropriate but significantly more general analogy involving approximation only by reduced fractions (which is much more useful). We will discuss its 2020 resolution by Maynard and Dimitris Koukoulopoulos.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.203
Threshold uncertainty score0.418

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.045
GPT teacher head0.332
Teacher spread0.288 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2023
Admission routes2
Has abstractyes

Explore more

Same venueBulletin of the American Mathematical SocietySame topicAnalytic Number Theory ResearchFrench-language works237,207