Visibly irreducible polynomials over finite fields

DOI10.1080/00029890.2020.1677103MaRDI QIDQ5208781zbMATH OpenOpenAlexWikidataFDO

Authors Evan O'Dorney

Publication date 10 January 2020

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.10440

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Linear algebraic groups over finite fields (20G40)

Abstract: H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the other. We classify polynomials over finite fields that admit an irreducibility proof with this structure.

Recommendations

• Irreducible cubics modulo five
• Reducible over any finite field but irreducible over Q
• Irreducibility criterion over finite fields
• Irreducible polynomials over a finite field
• Some classes of irreducible polynomials

Cites work

• Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
• Generalization of a theorem of Carlitz
• Irreducible cubics modulo five
• On the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\)
• Some theorems on irreducible reciprocal polynomials over a finite field.

Cited in

(2)

• GALOIS IRREDUCIBLE POLYNOMIALS
• Irreducible cubics modulo five

This page was built for publication: Visibly irreducible polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208781)