Lattice Basis Reduction

2011 ◽  
Author(s):  
Murray R. Bremner
2017 ◽  
Vol 86 (5) ◽  
pp. 1023-1038 ◽  
Author(s):  
Weihua Liu ◽  
Andrew Klapper ◽  
Zhixiong Chen

2012 ◽  
Vol 81 (279) ◽  
pp. 1487-1511 ◽  
Author(s):  
Xiao-Wen Chang ◽  
Damien Stehlé ◽  
Gilles Villard

2015 ◽  
Vol 18 (1) ◽  
pp. 633-646 ◽  
Author(s):  
Michael A. Bennett ◽  
Amir Ghadermarzi

We solve the Diophantine equation$Y^{2}=X^{3}+k$for all nonzero integers$k$with$|k|\leqslant 10^{7}$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower bounds for linear forms in logarithms in conjunction with lattice-basis reduction.


Sign in / Sign up

Export Citation Format

Share Document