Unlikely intersections over finite fields: polynomial orbits in small subgroups

From MaRDI portal
Publication:2281606



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.




Cites work









This page was built for publication: Unlikely intersections over finite fields: polynomial orbits in small subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2281606)