MétaCan
Menu
Back to cohort
Record W2946357414 · doi:10.1093/qmath/haaa031

Short Character Sums and the Pólya–Vinogradov Inequality

2020· preprint· en· W2946357414 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

VenueThe Quarterly Journal of Mathematics · 2020
Typepreprint
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsConverseCharacter (mathematics)CombinatoricsOrder (exchange)MathematicsModuloGeometry

Abstract

fetched live from OpenAlex

Abstract We show in a quantitative way that any odd primitive character χ modulo q of fixed order g ≥ 2 satisfies the property that if the Pólya–Vinogradov inequality for χ can be improved to $$\begin{equation*} \max_{1 \leq t \leq q} \left|\sum_{n \leq t} \chi(n)\right| = o_{q \rightarrow \infty}(\sqrt{q}\log q) \end{equation*}$$ then for any ɛ > 0 one may exhibit cancellation in partial sums of χ on the interval [1, t] whenever $t \gt q^{\varepsilon}$, i.e., $$\begin{equation*} \sum_{n \leq t} \chi(n) = o_{q \rightarrow \infty}(t)\ \text{for all } t \gt q^{\varepsilon}. \end{equation*}$$ We also prove a converse implication, to the effect that if all odd primitive characters of fixed order dividing g exhibit cancellation in short sums then the Pólya–Vinogradov inequality can be improved for all odd primitive characters of order g. Some applications are also discussed.

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.011
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Research integrity
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.254
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0110.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.003
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.118
GPT teacher head0.373
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