MétaCan
Menu
Back to cohort
Record W2020806681 · doi:10.1090/s0025-5718-00-01247-3

Irreducibility testing over local fields

2000· article· en· W2020806681 on OpenAlexaff
Peter Walsh

Bibliographic record

VenueMathematics of Computation · 2000
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsMathematicsIrreducibilityIrreducible polynomialLaurent seriesPolynomial ringLaurent polynomialField (mathematics)Minimal polynomial (linear algebra)Finite fieldPolynomialRational numberBivariate analysisRing (chemistry)Pure mathematicsRational functionDiscrete mathematicsSeries (stratigraphy)Algebra over a fieldSquare-free polynomialMatrix polynomialMathematical analysisStatistics

Abstract

fetched live from OpenAlex

The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q ( ( x ) ) [ y ] \mathbf {Q}((x))[y] , the ring of polynomials with coefficients from the field of Laurent series in x x with rational coefficients. This is achieved by computing certain associated Puiseux expansions, and as a result, a polynomial-time complexity bound for the number of bit operations required to perform this irreducibility test is computed.

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.013
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.013
Threshold uncertainty score0.042

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.013
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.004
Scholarly communication0.0030.008
Open science0.0020.004
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0130.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.025
GPT teacher head0.263
Teacher spread0.239 · 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

Citations2
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueMathematics of ComputationSame topicCoding theory and cryptographyFrench-language works237,207