A generalization of a theorem of Carlitz.
Car, Mireille (1994)
Portugaliae Mathematica
Similarity:
Displaying similar documents to “An algorithm for finding distinguished chains of polynomials.”
A generalization of a theorem of Carlitz.
Self-reciprocal polynomials over finite fields.
Meyn, Helmut, Götz, Werner (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
An irreducibility criterion for polynomials in several variables
Marius Cavachi, Marian Vâjâitu, Alexandru Zaharescu (2004)
Acta Mathematica Universitatis Ostraviensis
Similarity:
An irreducibility criterion for composition of polynomials.
Zaharescu, Alexandru (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Root separation for reducible monic quartics
Andrej Dujella, Tomislav Pejković (2011)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
On the irreducibility of 0,1-polynomials of the form f(x)xⁿ + g(x)
Michael Filaseta, Manton Matthews, Jr. (2004)
Colloquium Mathematicae
Similarity:
If f(x) and g(x) are relatively prime polynomials in ℤ[x] satisfying certain conditions arising from a theorem of Capelli and if n is an integer > N for some sufficiently large N, then the non-reciprocal part of f(x)xⁿ + g(x) is either identically ±1 or is irreducible over the rationals. This result follows from work of Schinzel in 1965. We show here that under the conditions that f(x) and g(x) are relatively prime 0,1-polynomials (so each coefficient is either 0 or 1) and f(0) =...
On the decomposition of .
Gomez-Calderon, Javier (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The irreducibility of compositions of linear polynomials over a finite field
S. D. Cohen (1982)
Compositio Mathematica
Similarity:
Classification of irreducible factorable polynomials over a finite field
Andrew Long (1967)
Acta Arithmetica
Similarity: