MétaCan
Menu
Back to cohort
Record W4248613845 · doi:10.22215/etd/2015-10627

Deterministic Factorization of Polynomials over Finite Fields

2015· dissertation· en· W4248613845 on OpenAlexaff
David A. Marquis

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsCarleton University
Fundersnot available
KeywordsFinite fieldMathematicsFactorization of polynomialsFactorizationEuler's totient functionDegree (music)PolynomialBounded functionCoprime integersField (mathematics)Prime factorDiscrete mathematicsDifference polynomialsPrime (order theory)Euler's formulaOrthogonal polynomialsCombinatoricsPure mathematicsMatrix polynomialAlgorithmMathematical analysis

Abstract

fetched live from OpenAlex

We give new results for the problem of deterministically and unconditionally factoring polynomials over finite fields. We give efficient algorithms for the factorization of some odd degree polynomials over finite fields. We remove the assumption of the Extended Riemann Hypothesis from a well known algorithm for factoring polynomials over finite fields in the case that the degree of the polynomial to be factored is coprime to (p -1) where p is the characteristic of the field and is the Euler totient function. We also give new results on the factorization of polynomials of bounded degree.

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 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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.921
Threshold uncertainty score0.563

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
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.019
GPT teacher head0.284
Teacher spread0.266 · 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 teacher head, 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
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicCoding theory and cryptographyFrench-language works237,207