A note on squares in arithmetic progressions. II
An old conjecture of Rudin asserts that there is an absolute constant \(C\) such that any non--constant \(N\)--term arithmetic progression of integers contains at most \(C\sqrt{N}\) perfect squares. In the paper it is shown that this number of squares is smaller than, or at most equal to, \(c_1N^{3/5}(\log N)^{c_2}\), where \(c_1,c_2\) are two positive absolute and computable constants. This reduces the exponent in the previous best known result by \textit{E. Bombieri, A. Granville} and \textit{J.Pintz} [Duke Math. J. 66, 369--385 (1992; Zbl 0771.11034)]. The proof employs many arguments used in this paper but a substantial novelty is that instead of working with algebraic projective curves of genus \(5\) the proof uses elliptic curves.
- Squares in arithmetic progressions
- Powers in arithmetic progressions
- Uniform bounds for the number of powers in arithmetic progressions
- The Elekes-Szabó problem and the uniformity conjecture
- Five squares in arithmetic progression over quadratic fields
- Shifted products that are coprime pure powers
- DISTANCE BETWEEN ARITHMETIC PROGRESSIONS AND PERFECT SQUARES
- Squares in Arithmetic Progressions and Infinitely Many Primes
- scientific article; zbMATH DE number 6957250 (Why is no real title available?)
- Discrete fractional integrals, lattice points on short arcs, and Diophantine approximation
- On a conjecture of Rudin on squares in arithmetic progressions
- Near optimal bounds in Freiman's theorem
- The Uniformity Conjecture in Additive Combinatorics
- Decoupling inequalities for short generalized Dirichlet sequences
- Squares in arithmetic progression over number fields
- Statistics of ranks, determinants and characteristic polynomials of rational matrices
- Two-dimensional arithmetic progressions avoiding squares
This page was built for publication: A note on squares in arithmetic progressions. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568671)
