Multiplicative energy of polynomial images of intervals modulo q

DOI10.4171/RMI/1017MaRDI QIDQ1989540zbMATH OpenOpenAlexFDO

Authors Kyle Castro, Mei-Chu Chang

Publication date 26 October 2018

Published in Revista Matemática Iberoamericana (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/rmi/1017

zbMATH Keywords

character sumspolynomial imagessubgroups of finite fields

Mathematics Subject Classification ID

Sums over arbitrary intervals (11L26) Estimates on character sums (11L40)

Review text

Summary: Given a smooth integer \(q\), we use existing upper bounds for character sums to find a lower bound for the size of a multiplicative subgroup of the integers modulo \(q\) which contains the image of an interval of consecutive integers \(I\subset\mathbb{Z}_q\) under a polynomial \(f\in\mathbb{Z}[X]\).

Recommendations

• Polynomial values in small subgroups of finite fields
• On a polynomial version of the sum-product problem for subgroups
• On the distribution of the residues of small multiplicative subgroups of \(\mathbb F_p\)
• New estimates for exponential sums over multiplicative subgroups and intervals in prime fields
• Double character sums over subgroups and intervals

Cited in

(1)

• Additive energy of polynomial images

This page was built for publication: Multiplicative energy of polynomial images of intervals modulo \(q\)

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