MétaCan
Menu
Back to cohort
Record W2467953035 · doi:10.1090/conm/579/11527

On the Waring Problem with multivariate Dickson polynomials

2012· other· en· W2467953035 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

VenueContemporary mathematics - American Mathematical Society · 2012
Typeother
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsCarleton University
Fundersnot available
KeywordsMathematicsMultivariate statisticsCombinatoricsAlgebra over a fieldPure mathematicsStatistics

Abstract

fetched live from OpenAlex

We extend recent results of Gomez and Winterhof, and Ostafe and Shparlinski on the Waring problem with univariate Dickson polynomials in a finite field to the multivariate case. We give some sufficient conditions for the existence of the Waring number for multivariate Dickson polynomials, that is, the smallest number <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="g"> <mml:semantics> <mml:mi>g</mml:mi> <mml:annotation encoding="application/x-tex">g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of summands needed to express any element of the finite field as sum of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="g"> <mml:semantics> <mml:mi>g</mml:mi> <mml:annotation encoding="application/x-tex">g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> values of the Dickson polynomial. Moreover, we prove strong bounds on the Waring number using a reduction to the case of fewer variables and an approach based on recent advances in arithmetic combinatorics due to Glibichuk and Rudnev.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient 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: Methods · Consensus signal: Methods
Teacher disagreement score0.224
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.026
GPT teacher head0.255
Teacher spread0.229 · 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