Papers
Topics
Authors
Recent
Search
2000 character limit reached

Absolute Bound On the Number of Solutions of Certain Diophantine Equations of Thue and Thue-Mahler Type

Published 27 Jun 2022 in math.NT | (2206.13653v1)

Abstract: Let $F \in \mathbb Z[x, y]$ be an irreducible binary form of degree $d \geq 7$ and content one. Let $\alpha$ be a root of $F(x, 1)$ and assume that the field extension $\mathbb Q(\alpha)/\mathbb Q$ is Galois. We prove that, for every sufficiently large prime power $pk$, the number of solutions to the Diophantine equation of Thue type $$ |F(x, y)| = tpk $$ in integers $(x, y, t)$ such that $\gcd(x, y) = 1$ and $1 \leq t \leq (pk)\lambda$ does not exceed $24$. Here $\lambda = \lambda(d)$ is a certain positive, monotonously increasing function that approaches one as $d$ tends to infinity. We also prove that, for every sufficiently large prime number $p$, the number of solutions to the Diophantine equation of Thue-Mahler type $$ |F(x, y)| = tpz $$ in integers $(x, y, z, t)$ such that $\gcd(x, y) = 1$, $z \geq 1$ and $1 \leq t \leq (pz){\frac{10d - 61}{20d + 40}}$ does not exceed 1992. Our proofs follow from the combination of two principles of Diophantine approximation, namely the generalized non-Archimedean gap principle and the Thue-Siegel principle.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.