An irreducibility criterion for composition of polynomials.
Zaharescu, Alexandru (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A generalization of a theorem of Carlitz.”
An irreducibility criterion for composition of polynomials.
The irreducibility of compositions of linear polynomials over a finite field
S. D. Cohen (1982)
Compositio Mathematica
Similarity:
Self-reciprocal polynomials over finite fields.
Meyn, Helmut, Götz, Werner (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
An algorithm for finding distinguished chains of polynomials.
Zaharescu, Alexandru (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Classification of irreducible factorable polynomials over a finite field
Andrew Long (1967)
Acta Arithmetica
Similarity:
Irreducible polynomials over finite fields with linearly independent roots
Štefan Schwarz (1988)
Mathematica Slovaca
Similarity:
An irreducibility criterion for polynomials in several variables
Marius Cavachi, Marian Vâjâitu, Alexandru Zaharescu (2004)
Acta Mathematica Universitatis Ostraviensis
Similarity: