MétaCan
Menu
Back to cohort
Record W3184031971 · doi:10.3336/gm.54.1.05

Diophantine m-tuples with the property D(n)

2019· article· en· W3184031971 on OpenAlex
Riley Becker, M. Ram Murty

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueGlasnik Matematicki · 2019
Typearticle
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsDiophantine equationInteger (computer science)TupleCombinatoricsBinary logarithmConstant (computer programming)Diophantine approximationDiscrete mathematicsLog-log plotProperty (philosophy)

Abstract

fetched live from OpenAlex

Let n be a non-zero integer.A set of m positive integers {a 1 , a 2 , • • • , am} such that a i a j + n is a perfect square for all 1 ≤ i < j ≤ m is called a Diophantine m-tuple with the property D(n).In a series of papers, Dujella studied the quantity Mn = sup{|S| : S has the property D(n)} and showed for |n| ≥ 400 that Mn ≤ 15. 476 log |n| and if |n| > 10 100 , then Mn < 9.078 log |n|.We refine his argument to show that Cn ≤ 2 log |n| + O log |n| (log log |n|) 2 , where the implied constant is effectively computable and Cn = sup{|S ∩ [1, n 2 ]| : S has the property D(n)}.Together with earlier work of Dujella, this implies Mn ≤ 2.6071 log |n| + O log |n| (log log |n|) 2 , where the implied constant is effectively computable.

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.

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.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
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.089
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.003

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.034
GPT teacher head0.296
Teacher spread0.263 · 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