On fully split lacunary polynomials in finite fields

2011/11/17 by Khodakhast Bibak, Bibak, Khodakhast, Igor E. Shparlinski +1
Computer Science · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #Limits and Structures in Graph Theory #math.NT

paper · pdf · doi:10.48550/arxiv.1111.4023

8 pages. Bull. Polish Acad. Sci. Math., to appear

arxiv created 2011/11/17 · arxiv updated 2011/11/18

Abstract

We estimate the number of possible types 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.

Related

• Computing the multilinear factors of lacunary polynomials without heights
• Combinatorial problems in finite geometry and lacunary polynomials
• On the Factorization of lacunary polynomials
• Lacunary Polynomial Compositions
• On a combinatorial puzzle arising from the theory of Lascoux polynomials