Squares in arithmetic progressions (Q1196391): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: János Pintz / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Dieter Wolke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3209230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of rational points of a plane algebraic curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine Equations with Special Reference To Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jacobian Variety of an Algebraic Curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number theory III: Diophantine geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079680 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1215/s0012-7094-92-06612-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071628284 / rank
 
Normal rank

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Squares in arithmetic progressions
scientific article

    Statements

    Squares in arithmetic progressions (English)
    0 references
    0 references
    0 references
    0 references
    14 December 1992
    0 references
    In this high-level paper the authors prove that the number of squares in the arithmetic progression \(a+nq\) (\(1\leq n\leq N\), \(q\neq 0\)) is at most \(c_ 1 N^{2/3}(\log N)^{c_ 2}\) (\(c_ 1\), \(c_ 2\) are effectively computable, absolute constants). Even the proof of \(o(N)\) seems to be very difficult. One possible approach is via Szemeredi's theorem on sets without 4-term arithmetic progressions. The authors' goal is to apply Faltings' theorem on the number of rational points on a curve of genus \(g\geq 2\). Let \(qn_ i+a=m_ i^ 2\) (\(i=0,\dots,4\); \(n_ i\) distinct), \({\mathbf n}=(n_ 0,\dots,n_ 4)\). Then \({\mathbf n}\) determines a rational point \({\mathbf m}=(m_ 0,\dots,m_ 4)\) on the algebraic projective curve of genus 5 \[ C_ 3: (n_ i-n_{i+1})x_{i-1}^ 2+(n_{i+1}- n_{i-1}) x_ i^ 2+(n_{i-1}-n_ i)x_{i+1}^ 2=0 \qquad (i=1,2,3). \] A detailed study of such curves, in particular of the rank of the Mordell-Weil group of rational points of the Jacobian, together with the first author's simplified proof of Faltings' theorem [Ann. Sc. Norm. Super. Pisa, Cl. Sci., IV. Ser. 17, No. 4, 615-640 (1990; Zbl 0722.14010)] lead to an explicit upper bound for the number of rational points on \(C_ 3\). Some combinatorial arguments, which, as the authors remark, could possibly be improved, finally lead to the main result. It is the authors' hope that the similar problem with higher powers in arithmetic progressions can be treated in an analogue way, however there are still some complications in the study of the Mordell-Weil group of the Jacobian of the associated curves.
    0 references
    number of squares
    0 references
    arithmetic progression
    0 references
    Faltings' theorem
    0 references
    number of rational points
    0 references
    Mordell-Weil group
    0 references
    explicit upper bound
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references