A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields
From MaRDI portal
Publication:5267795
Abstract: We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then investigate binary operations defined by polynomial functions, and give a sufficient condition in terms of degrees for the requirement in the Brawley-Carlitz theorem.
Recommendations
- Irreducibles and the composed product for polynomials over a finite field
- A note on composed products of polynomials over finite fields
- Irreducibility and multiplicative composition of polynomials over finite fields
- A note on the number of irreducible polynomials over finite fields
- On the reducibility of some composite polynomials over finite fields
- Irreducible compositions of polynomials over finite fields
- Irreducible compositions of polynomials over finite fields of even characteristic
- Irreducible polynomials over finite fields produced by composition of quadratics
- Composed products and module polynomials over finite fields
- scientific article; zbMATH DE number 1001374
Cites work
Cited in
(5)- A note on composed products of polynomials over finite fields
- scientific article; zbMATH DE number 2027898 (Why is no real title available?)
- On a conjecture on irreducible polynomials over finite fields with restricted coefficients
- Three remarks on Powers’ theorem about irreducible fields fulfilling CAR
- On diamond products ensuring irreducibility of the associated composed product
This page was built for publication: A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267795)