MétaCan
Menu
Back to cohort
Record W1965036528 · doi:10.4171/lem/59-3-4

Une version effective du théorème de Lindemann-Weierstrass par des méthodes d'indépendance algébrique

2014· preprint· fr· W1965036528 on OpenAlexaff
Damien Roy

Bibliographic record

VenueL’Enseignement Mathématique · 2014
Typepreprint
Languagefr
FieldMathematics
TopicFunctional Equations Stability Results
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsIndependence (probability theory)NoveltyAlgebraic numberSimplicityExploitMathematicsAlgorithmAlgebra over a fieldComputer sciencePure mathematicsPhysicsPhilosophyMathematical analysisStatisticsQuantum mechanics

Abstract

fetched live from OpenAlex

We present a new completely effective proof of the Lindemann-Weierstrass theorem based on algebraic independence methods. Although it is slightly weaker than the best known estimate due to A. Sert, it improves the best estimate due to M. Ably obtained by such methods. The novelty of the proof lies in the simplicity of the construction of auxiliary functions, a fact that we exploit to introduce the non-specialist to methods of algebraic independence.

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.003
metaresearch head score (Gemma)0.006
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.008
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.006
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0010.003
Research integrity0.0010.006
Insufficient payload (model declined to judge)0.0080.002

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.020
GPT teacher head0.278
Teacher spread0.258 · 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

Citations0
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueL’Enseignement MathématiqueSame topicFunctional Equations Stability ResultsFrench-language works237,207