Displaying similar documents to “Combinatorial Computations on an Extension of a Problem by Pál Turán”

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

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

Generalized Krawtchouk polynomials: New properties

Norris Sookoo (2000)

Archivum Mathematicum

Similarity:

Orthogonality conditions and recurrence relations are presented for generalized Krawtchouk polynomials. Coefficients are evaluated for the expansion of an arbitrary polynomial in terms of these polynomials and certain special values for generalized Krawtchouk polynomials are obtained. Summations of some of these polynomials and of certain products are also considered.

On Fully Split Lacunary Polynomials in Finite Fields

Khodakhast Bibak, Igor E. Shparlinski (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We estimate the number of possible degree patterns of k-lacunary polynomials of degree t < p which split completely modulo p. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.