MétaCan
Menu
Back to cohort
Record W2804660503 · doi:10.1515/ms-2017-0121

On the proximity of multiplicative functions to the number of distinct prime factors function

2018· article· en· W2804660503 on OpenAlex

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.

Bibliographic record

VenueMathematica Slovaca · 2018
Typearticle
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsUniversité Laval
Fundersnot available
KeywordsMultiplicative functionMathematicsCombinatoricsPrime factorMultiplicity (mathematics)Integer (computer science)Prime (order theory)Function (biology)Mathematical analysis

Abstract

fetched live from OpenAlex

Abstract Given an additive function f and a multiplicative function g , let E ( f , g ; x ) = #{ n ≤ x : f ( n ) = g ( n )}. We study the size of E ( ω , g ; x ) and E (Ω, g ; x ), where ω ( n ) stands for the number of distinct prime factors of n and Ω( n ) stands for the number of prime factors of n counting multiplicity. In particular, we show that E ( ω , g ; x ) and E (Ω, g ; x ) are <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mtable> <m:mtr> <m:mtd> <m:mstyle> <m:mi>O</m:mi> <m:mfenced> <m:mfrac> <m:mi>x</m:mi> <m:msqrt> <m:mi>log</m:mi> <m:mi>log</m:mi> <m:mo>⁡</m:mo> <m:mi>x</m:mi> </m:msqrt> </m:mfrac> </m:mfenced> </m:mstyle> </m:mtd> </m:mtr> </m:mtable> </m:math> $\begin{array}{} \displaystyle O\left(\frac{x}{\sqrt{\log\log x}}\right) \end{array}$ for any integer valued multiplicative function g . This improves an earlier result of De Koninck, Doyon and Letendre.

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.004
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.108
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.004
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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.001

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.076
GPT teacher head0.356
Teacher spread0.281 · 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