2000 character limit reached
On Solutions to Some Polynomial Congruences in Small Boxes
Published 9 Jan 2013 in math.NT | (1301.1758v1)
Abstract: We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side length below $p{1/2}$, which seems to be the limit of more general methods based on the bounds of exponential sums along varieties.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.