Displaying similar documents to “Irreducible factors of Psi-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 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.