On sums of four cubes of polynomials
On ternary inclusion-exclusion polynomials.
On the coefficients of the cyclotomic polynomial
On the divisibility of polynomials with integer coefficients.
On the generalization of the Fibonacci-coefficient polynomials.
On the height of cyclotomic polynomials
On the irreducibility of 0,1-polynomials of the form f(x)xⁿ + g(x)
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) = g(0) = 1, one...
On the irreducibility of -quadrinomials.
On the Irreducibility of Polynomials Taking Small Values.
On the irreducibility of some polynomials in two variables
On the irreducibility of the generalized Laguerre polynomials
On the Lehmer constant of finite cyclic groups
On the number of irreducible polynomials with 0,1 coefficients
On the number of polynomials of bounded measure
On the number of terms of a composite polynomial
On the number of terms of a power of a polynomial
On the product ...(1-z...k).
On the reducibility type of trinomials
On the reduction of Kronecker's modular systems whose elements are functions of two and three variables.
On three questions concerning -polynomials
We answer three reducibility (or irreducibility) questions for -polynomials, those polynomials which have every coefficient either or . The first concerns whether a naturally occurring sequence of reducible polynomials is finite. The second is whether every nonempty finite subset of an infinite set of positive integers can be the set of positive exponents of a reducible -polynomial. The third is the analogous question for exponents of irreducible -polynomials.