Efficient resolution of Thue-Mahler equations

arXiv2207.14492MaRDI QIDQ6406428FDOQ6406428

Samir Siksek, Adela Gherga

Publication date: 29 July 2022

Abstract: A Thue-Mahler equation is a Diophantine equation of the form ${\displaystyle }$F(X,Y) = acdot p_1^{z_1}cdots p_v^{z_v}, qquad gcd(X,Y)=1${\displaystyle }$ where $F$ be an irreducible homogeneous binary form of degree at least $3$ with integer coefficients, $a$ is a non-zero integer and $p_1,dots,p_v$ are rational primes. Existing algorithms for resolving such equations require computations in the number field obtained by adjoining three roots of $F(X,1)=0$. We give a new algorithm that requires computations only in the number field obtained by adjoining one root, making it far more suited for higher degree examples. We also introduce a lattice sieving technique reminiscent of the Mordell--Weil sieve that makes it practical to tackle Thue--Mahler equations of higher degree and with larger sets of primes. We give several examples including one of degree $11$. Let $P(m)$ denote the largest prime divisor of an integer $mge2$. As an application of our algorithm we determine all pairs $(X,Y)$ of coprime non-negative integers such that $P(X^4-2Y^4)le100$, finding that there are precisely $49$ such pairs.

Has companion code repository: https://github.com/pjcazorla/differences-between-perfect-and-prime-powers

Mathematics Subject Classification ID

Thue-Mahler equations (11D59)

This page was built for publication: Efficient resolution of Thue-Mahler equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406428)