Solving effectively some families of Thue Diophantine equations
Abstract
Let α be an algebraic number of degree d 3 and let K be the algebraic number field (α). When is a unit of K such that (α)=K, we consider the irreducible polynomial f(X) ∈ [X] such that f(α)=0. Let F(X,Y) be the irrreducible binary form of degree d associated to f(X) under the condition F(X,1)=f(X). For each positive integer m, we want to exhibit an effective upper bound for the solutions (x,y,) of the diophantine inequation |F(x,y)| m. We achieve this goal by restricting ourselves to a subset of units which we prove to be sufficiently large as soon as the degree of K is ≥ 4.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.