MétaCan
Menu
Back to cohort
Record W2611888257 · doi:10.1090/mcom/3363

Computing isomorphisms and embeddings of finite fields

2018· article· en· W2611888257 on OpenAlex
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost

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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueMathematics of Computation · 2018
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsFinite fieldIsomorphism (crystallography)EmbeddingFactorizationMathematicsField (mathematics)PolynomialAlgebra over a fieldCode (set theory)Discrete mathematicsCombinatoricsPure mathematicsAlgorithmComputer scienceProgramming languageMathematical analysis

Abstract

fetched live from OpenAlex

Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper F Subscript q"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">F</mml:mi> </mml:mrow> <mml:mi>q</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">\mathbb {F}_q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a finite field. Given two irreducible polynomials <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="f comma g"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo>,</mml:mo> <mml:mi>g</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">f,g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> over <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper F Subscript q"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">F</mml:mi> </mml:mrow> <mml:mi>q</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">\mathbb {F}_q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , with <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="degree f"> <mml:semantics> <mml:mrow> <mml:mi>deg</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>f</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\deg f</mml:annotation> </mml:semantics> </mml:math> </inline-formula> dividing <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="degree g"> <mml:semantics> <mml:mrow> <mml:mi>deg</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>g</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\deg g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , the finite field embedding problem asks to compute an explicit description of a field embedding of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper F Subscript q Baseline left-bracket upper X right-bracket slash f left-parenthesis upper X right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">F</mml:mi> </mml:mrow> <mml:mi>q</mml:mi> </mml:msub> <mml:mo stretchy="false">[</mml:mo> <mml:mi>X</mml:mi> <mml:mo stretchy="false">]</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>X</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {F}_q[X]/f(X)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> into <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper F Subscript q Baseline left-bracket upper Y right-bracket slash g left-parenthesis upper Y right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">F</mml:mi> </mml:mrow> <mml:mi>q</mml:mi> </mml:msub> <mml:mo stretchy="false">[</mml:mo> <mml:mi>Y</mml:mi> <mml:mo stretchy="false">]</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>g</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>Y</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {F}_q[Y]/g(Y)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . When <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="degree f equals degree g"> <mml:semantics> <mml:mrow> <mml:mi>deg</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>f</mml:mi> <mml:mo>=</mml:mo> <mml:mi>deg</mml:mi> <mml:mo> ⁡ </mml:mo> <mml:mi>g</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\deg f = \deg g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , this is also known as the isomorphism problem. This problem, a special instance of polynomial factorization, plays a central role in computer algebra software. We review previous algorithms, due to Lenstra, Allombert, Rains, and Narayanan, and propose improvements and generalizations. Our detailed complexity analysis shows that our newly proposed variants are at least as efficient as previously known algorithms, and in many cases significantly better. We also implement most of the presented algorithms, compare them with the state of the art computer algebra software, and make the code available as an open source. Our experiments show that our new variants consistently outperform available software.

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.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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.642
Threshold uncertainty score0.265

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.0000.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.014
GPT teacher head0.258
Teacher spread0.244 · 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