arXiv · 1904.12621
Unlikely intersections over finite fields: polynomial orbits in small subgroups
Abstract
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$ elements in an orbit. We derive these from more general results about sequences of compositions or a fixed set of polynomials.
Explore related subjects
Keep this discovery
László Mérai, Igor E. Shparlinski. 2019-09-11. Unlikely intersections over finite fields: polynomial orbits in small subgroups. https://arxiv.org/abs/1904.12621
Cite the original work for its findings. Save a collection to share your selection of sources.