Attaining the Exponent 5/4 for the Sum-Product Problem in Finite Fields

DOI10.1093/IMRN/RNAB338MaRDI QIDQ5886575zbMATH OpenOpenAlexFDO

Authors Ali Mohammadi, Sophie Stevens

Publication date 5 April 2023

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.08252

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30) Additive bases, including sumsets (11B13)

Recommendations

• An improved sum-product estimate for general finite fields
• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
• ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
• Quantitative sum product estimates on different sets
• On growth of the set A(A+1) in arbitrary finite fields

Cited in

(4)

• On the discretised \(ABC\) sum-product problem
• The Erdős-Szemerédi problem on sum set and product set
• Attaining the exponent $5/4$ for the sum-product problem in finite fields
• Avoiding 5/4-powers on the alphabet of nonnegative integers

This page was built for publication: Attaining the Exponent 5/4 for the Sum-Product Problem in Finite Fields

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