Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 157 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 35 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 97 tok/s Pro
Kimi K2 218 tok/s Pro
GPT OSS 120B 450 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Points on polynomial curves in small boxes modulo an integer (1803.10373v1)

Published 28 Mar 2018 in math.NT

Abstract: Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form $$y\equiv f(x) \pmod{q},$$ with integer variables lying in some cube $\mathcal B$ of side length $H$. Our argument uses ideas of Cilleruelo, Garaev, Ostafe and Shparlinski which reduces the problem to the Vinogradov mean value theorem and a lattice point counting problem. We treat the lattice point problem differently using transference principles from the Geometry of Numbers. We also use a variant of the main conjecture for the Vinogradov mean value theorem of Bourgain, Demeter and Guth and of Wooley which allows one to deal with rather sparse sets.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.