2022/01/03 by Igor E. Shparlinski, Shparlinski, Igor E.
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Coding theory and cryptography #Analytic Number Theory Research
paper · pdf · doi:10.48550/arxiv.2201.00585
We obtain upper bounds on the cardinality of Hilbert cubes in finite fields, which avoid large product sets and reciprocals of sum sets. In particular, our results replace recent estimates of N. Hegyvári and P. P. Pach (2020), which appear to be void for all admissible parameters. Our approach is different from that of N. Hegyvári and P. P. Pach and is based on some well-known bounds of double character and exponential sums over arbitrary sets, due to A. A. Karatsuba (1991) and N. G. Moshchevitin (2007), respectively.