{"title":"Small solutions of generic ternary quadratic congruences to general moduli","authors":"Stephan Baier, Aishik Chattopadhyay","doi":"10.1016/j.ffa.2025.102571","DOIUrl":null,"url":null,"abstract":"<div><div>We study small non-trivial solutions of quadratic congruences of the form <span><math><msubsup><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></msubsup><mo>+</mo><msub><mrow><mi>α</mi></mrow><mrow><mn>2</mn></mrow></msub><msubsup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>2</mn></mrow></msubsup><mo>+</mo><msub><mrow><mi>α</mi></mrow><mrow><mn>3</mn></mrow></msub><msubsup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow><mrow><mn>2</mn></mrow></msubsup><mo>≡</mo><mn>0</mn><mspace></mspace><mrow><mi>mod</mi></mrow><mspace></mspace><mi>q</mi></math></span>, with <em>q</em> being an odd natural number, in an average sense. This extends previous work of the authors in which they considered the case of prime power moduli <em>q</em>. Above, <span><math><msub><mrow><mi>α</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> is arbitrary but fixed and <span><math><msub><mrow><mi>α</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> is variable, and we assume that <span><math><mo>(</mo><msub><mrow><mi>α</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>α</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>,</mo><mi>q</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span>. We show that for all <span><math><msub><mrow><mi>α</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> modulo <em>q</em> which are coprime to <em>q</em> except for a small number of <span><math><msub><mrow><mi>α</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span>'s, an asymptotic formula for the number of solutions <span><math><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>)</mo></math></span> to the congruence <span><math><msubsup><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></msubsup><mo>+</mo><msub><mrow><mi>α</mi></mrow><mrow><mn>2</mn></mrow></msub><msubsup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>2</mn></mrow></msubsup><mo>+</mo><msub><mrow><mi>α</mi></mrow><mrow><mn>3</mn></mrow></msub><msubsup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow><mrow><mn>2</mn></mrow></msubsup><mo>≡</mo><mn>0</mn><mspace></mspace><mrow><mi>mod</mi></mrow><mspace></mspace><mi>q</mi></math></span> with <span><math><mi>max</mi><mo></mo><mo>{</mo><mo>|</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>|</mo><mo>,</mo><mo>|</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>|</mo><mo>,</mo><mo>|</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>|</mo><mo>}</mo><mo>≤</mo><mi>N</mi></math></span> and <span><math><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>,</mo><mi>q</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span> holds if <span><math><mi>N</mi><mo>≥</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>11</mn><mo>/</mo><mn>24</mn><mo>+</mo><mi>ε</mi></mrow></msup></math></span> and <em>q</em> is large enough. It is of significance that we break the barrier 1/2 in the above exponent. Key tools in our work are Burgess's estimate for character sums over short intervals and Heath-Brown's estimate for character sums with binary quadratic forms over small regions whose proofs depend on the Riemann hypothesis for curves over finite fields. We also formulate a refined conjecture about the size of the smallest solution of a ternary quadratic congruence, using information about the Diophantine properties of its coefficients.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"103 ","pages":"Article 102571"},"PeriodicalIF":1.2000,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725000012","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We study small non-trivial solutions of quadratic congruences of the form , with q being an odd natural number, in an average sense. This extends previous work of the authors in which they considered the case of prime power moduli q. Above, is arbitrary but fixed and is variable, and we assume that . We show that for all modulo q which are coprime to q except for a small number of 's, an asymptotic formula for the number of solutions to the congruence with and holds if and q is large enough. It is of significance that we break the barrier 1/2 in the above exponent. Key tools in our work are Burgess's estimate for character sums over short intervals and Heath-Brown's estimate for character sums with binary quadratic forms over small regions whose proofs depend on the Riemann hypothesis for curves over finite fields. We also formulate a refined conjecture about the size of the smallest solution of a ternary quadratic congruence, using information about the Diophantine properties of its coefficients.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.