The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Upper bounds for the coefficients of irreducible integer polynomials in several variables”

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 ℚ.

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’...

Integer Linear Programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4

Souad El Otmani, Armand Maul, Georges Rhin, Jean-Marc Sac-Épée (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this work, we propose a new method to find monic irreducible polynomials with integer coefficients, only real roots, and span less than 4. The main idea is to reduce the search of such polynomials to the solution of Integer Linear Programming problems. In this frame, the coefficients of the polynomials we are looking for are the integer unknowns. We give inequality constraints specified by the properties that the polynomials should have, such as the typical distribution of their roots....