Small Solutions of generic ternary quadratic congruences
Stephan Baier, Aishik Chattopadhyay

TL;DR
This paper establishes asymptotic formulas for small solutions to certain quadratic congruences modulo prime powers, breaking previous barriers and improving results under specific hypotheses.
Contribution
It provides new bounds for the size of solutions to quadratic congruences, surpassing the 1/2 barrier, and refines these bounds using advanced number theory techniques.
Findings
Breaks the 1/2 barrier for solution size exponent.
Improves bounds using p-adic exponent pairs.
Under Lindelöf hypothesis, achieves an exponent of 1/3.
Abstract
We consider small solutions of quadratic congruences of the form , where is an odd prime power. Here, is arbitrary but fixed and is variable, and we assume that . We show that for all modulo which are coprime to except for a small number of 's, an asymptotic formula for the number of solutions to the congruence with holds if as tends to infinity over the set of all odd prime powers. It is of significance that we break the barrier 1/2 in the above exponent. If is restricted to powers of a {\it fixed} prime and tends to infinity, we obtain a slight improvement of this result using the theory of -adic…
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 · Advanced Mathematical Identities · Algebraic Geometry and Number Theory
