On fully split lacunary polynomials in finite fields
Khodakhast Bibak, Igor E. Shparlinski

TL;DR
This paper estimates the variety of degree patterns for lacunary polynomials that split completely over finite fields, using bounds on zeros and graph theory techniques.
Contribution
It introduces a novel approach combining zero bounds and graph theory to analyze lacunary polynomials over finite fields.
Findings
Bound on the number of degree patterns for lacunary polynomials
Application of graph theory to polynomial splitting
Enhanced understanding of polynomial zero distribution
Abstract
We estimate the number of possible types degree patterns of -lacunary polynomials of degree which split completely modulo . The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Limits and Structures in Graph Theory · Cellular Automata and Applications
