Displaying similar documents to “Self-reciprocal polynomials over finite fields.”

Combinatorial Computations on an Extension of a Problem by Pál Turán

Gaydarov, Petar, Delchev, Konstantin (2015)

Serdica Journal of Computing

Similarity:

Turan’s problem asks what is the maximal distance from a polynomial to the set of all irreducible polynomials over Z. It turns out it is sufficient to consider the problem in the setting of F2. Even though it is conjectured that there exists an absolute constant C such that the distance L(f - g) <= C, the problem remains open. Thus it attracts different approaches, one of which belongs to Lee, Ruskey and Williams, who study what the probability is for a set of polynomials ‘resembling’...

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) =...

Irreducible polynomials with all but one zero close to the unit disk

DoYong Kwon (2016)

Colloquium Mathematicae

Similarity:

We consider a certain class of polynomials whose zeros are, all with one exception, close to the closed unit disk. We demonstrate that the Mahler measure can be employed to prove irreducibility of these polynomials over ℚ.