On the size of integer solutions of elliptic equations
Let \(K\) be a number field of degree \(d\) and \(O_K\) its ring of integers. Let \(f(x)= x^3+ ax+ b\) be a polynomial in \(O_K[x]\) with discriminant \(\Delta_f\neq 0\). \textit{D. Poulakis} [J. Aust. Math. Soc., Ser. A 63, 145-164 (1997; Zbl 0893.11010)], using the ``multiplication by 2 on an elliptic curve, obtained an upper bound for the size of the integer solutions of the elliptic equation \(y^2= f(x)\). In the paper under review, the author reworks the approach of Poulakis and deduces two new upper bounds which improve upon his estimate. We denote by \(H\), \(D_K\), \(N_K\) respectively, the height of \(f(x)\), the discriminant of \(K\) and the norm of \(K\). The first result of this paper asserts that if \(x,y\in O_K\) is a solution to the equation \(y^2= f(x)\), then the (multiplicative) heights of \(x\) and \(y\) are less than \[ H^{35}\exp\{(100d)^{100d}| D_K|^{12}| N_K(\Delta_f)|^7 (\log| D_K N_K(\Delta_f)|)^{24d-1}\}. \] Let \(t\) be the number of distinct prime ideals of \(O_K\) dividing \(\Delta_f\). We denote by \(P\) (respectively \(Q\)) the greatest prime factor (respectively the greatest square factor) of \(| N_K(\Delta_f)|\). The second result of this paper says that if \(x,y\in O_K\) is a solution to the equation \(y^2= f(x)\), then the (multiplicative) heights of \(x\) and \(y\) are at most \[ H^{35}\exp\{(100(t+ d))^{100(t+ d)} P^{24d} Q^{9d}| D_K|^6| N_K(\Delta_f)|^7 (\log| D_K|)^{12d+ 1}\}. \] Moreover, the results of this paper improve on the results of \textit{W. M. Schmidt} obtained by the ``classical method that goes back to Siegel and those of \textit{A. Pintér} [Bull. Aust. Math. Soc. 52, 195-199 (1995; Zbl 0839.11014)] obtained by reducing the problem to the study of Thue equations.
- The number of solutions to Mordell's equation in constrained ranges
- scientific article; zbMATH DE number 4040074
- ON THE NUMBER OF INTEGER POINTS ON THE ELLIPTIC CURVE y2 = x3 + Ax
- Integral points on elliptic curves associated with generalized twin primes
- The upper bound estimate of the number of integer points on elliptic curves \(y^2=x^3+p^{2r}x\)
- Solving Elliptic Diophantine Equations Avoiding Thue Equations and Elliptic Logarithms
- Integral points on congruent number curves
- Average normalisations of elliptic curves
- An elliptic curve having large integral points.
- An exact upper bound estimate for the number of integer points on the elliptic curves \(y^2= x^3-p^k x\)
- An upper bound for the size of integral solutions to \(Y^ m= f(X)\)
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 47154 (Why is no real title available?)
- scientific article; zbMATH DE number 3603347 (Why is no real title available?)
- scientific article; zbMATH DE number 1038336 (Why is no real title available?)
- Minorations de Combinaisons Linéaires de Logarithmes de Nombres Algébriques
- The Diophantine Equation y 2 = ax 3 +bx 2 +cx +d
- Explicit bounds for the solutions of elliptic equations with rational coefficients
- ON THE NUMBER OF INTEGER POINTS ON THE ELLIPTIC CURVE y2 = x3 + Ax
- Parallel LLL-reduction for bounding the integral solutions of elliptic Diophantine equations
- On the magnitude of integer points on elliptic curves
- Practical solution of the Diophantine equation $y^2 = x(x+2^ap^b)(x-2^ap^b)$
- Bounds for the smallest integral solution of Pell equation over a number field
- Effectiveness of Siegel's theorem and the abc conjecture
This page was built for publication: On the size of integer solutions of elliptic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399425)
