Papers
Topics
Authors
Recent
Search
2000 character limit reached

Solving effectively some families of Thue Diophantine equations

Published 27 Dec 2013 in math.NT | (1312.7205v1)

Abstract: Let $\alpha$ be an algebraic number of degree $d\ge 3$ and let $K$ be the algebraic number field $\Q(\alpha)$. When $\varepsilon$ is a unit of $K$ such that $\Q(\alpha\varepsilon)=K$, we consider the irreducible polynomial $f_\varepsilon(X) \in \Z[X]$ such that $f_\varepsilon(\alpha\varepsilon)=0$. Let $F_\varepsilon(X,Y)$ be the irrreducible binary form of degree $d$ associated to $f_{\varepsilon}(X) $ under the condition $F_{\varepsilon}(X,1)=f_{\varepsilon}(X)$. For each positive integer $m$, we want to exhibit an effective upper bound for the solutions $(x,y,\varepsilon)$ of the diophantine inequation $|F_\varepsilon(x,y)|\le m$. We achieve this goal by restricting ourselves to a subset of units $\varepsilon$ which we prove to be sufficiently large as soon as the degree of $K$ is $\geq 4$.

Summary

Paper to Video (Beta)

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.

Collections

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