MétaCan
Menu
Back to cohort
Record W1897223594 · doi:10.1090/s0025-5718-05-01777-1

An old conjecture of Erdos–Turán on additive bases

2005· article· lv· W1897223594 on OpenAlexafffund
Peter Borwein, Stephen Choi, Frank Chu

Bibliographic record

VenueMathematics of Computation · 2005
Typearticle
Languagelv
FieldComputer Science
TopicGraph Labeling and Dimension Problems
Canadian institutionsSimon Fraser University
FundersNatural Sciences and Engineering Research Council of CanadaMitacs
KeywordsAlgorithmConjectureArtificial intelligenceMathematicsComputer scienceCombinatorics

Abstract

fetched live from OpenAlex

There is a 1941 conjecture of Erdős and Turán on what is now called additive basis that we restate: Conjecture 0.1 (Erdős and Turán) . Suppose that 0 = δ 0 > δ 1 > δ 2 > δ 3 ⋯ 0 = \delta _0>\delta _1>\delta _2>\delta _3\cdots is an increasing sequence of integers and \[ s ( z ) := ∑ i = 0 ∞ z δ i . s(z) : = \sum _{i=0}^\infty z^{\delta _i}. \] Suppose that \[ s 2 ( z ) := ∑ i = 0 ∞ b i z i . s^2(z) := \sum _{i=0}^\infty b_i z^i. \] If b i > 0 b_i>0 for all i i , then { b n } \{b_n\} is unbounded. Our main purpose is to show that the sequence { b n } \{b_n\}

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.013
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0030.005
Scholarly communication0.0030.007
Open science0.0010.004
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0130.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.018
GPT teacher head0.273
Teacher spread0.255 · 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 source (direct Gemma or distilled Codex), 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

Citations23
Published2005
Admission routes2
Has abstractyes

Explore more

Same venueMathematics of ComputationSame topicGraph Labeling and Dimension ProblemsFrench-language works237,207