Open Collections

Implementation of a Thue-Mahler equation solver

University of British Columbia

A practical algorithm for solving an arbitrary Thue-Mahler equation is presented, and its correctness is proved. Methods of algebraic number theory are used to reduce the problem of solving the Thue-Mahler equation to the problem of solving a finite collection of related Diophatine equations having parameters in an algebraic number field. Bounds on the solutions of these equations are computed by employing the theory of linear forms in logarithms of algebraic numbers. Computational Diophantine approximation techniques based on lattice basis reduction are used to reduce the upper bounds to the point where a direct enumerative search of the solution space becomes possible. Such an enumerative search is carried out with the aid of a sieving procedure to finally determine the complete set of solutions of the Thue-Mahler equation. The algorithm is implemented in full generality as a function in the Magma computer algebra system. This is the first time a completely general algorithm for solving Thue-Mahler equations has been implemented as a computer program.

Text

2011-10-25

Attribution-NonCommercial-NoDerivatives 4.0 International

http://hdl.handle.net/2429/38244

Mathematics

University of British Columbia

UBCV

http://creativecommons.org/licenses/by-nc-nd/4.0/