On a symmetric congruence and its applications
M. Z. Garaev, A. A. Karatsuba

TL;DR
This paper derives an asymptotic formula for solutions to a specific congruence with four variables in residue classes modulo a large integer m, and applies it to problems in multiplication tables and exponential sums.
Contribution
It introduces a new asymptotic formula for a congruence involving four variables and applies it to improve bounds in multiplication table problems and exponential sums.
Findings
New asymptotic formula for solutions to a four-variable congruence
Improved bounds for the exceptional set in multiplication table problems
Enhanced estimates for double trigonometric sums with exponential functions
Abstract
For a large integer we obtain an asymptotic formula for the number of solutions of a certain congruence modulo with four variables, where the variables belong to special sets of residue classes modulo This formula are applied to obtain new information on the exceptional set of the multiplication table problem in a residue ring modulo and a new bound for a double trigonometric sum with an exponential function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Cryptography and Residue Arithmetic · Coding theory and cryptography
