2000 character limit reached
Solving simultaneously Thue equations in the almost totally imaginary case (1505.06653v1)
Published 25 May 2015 in math.NT
Abstract: Let $\alpha$ be an algebraic number of degree $d\ge 3$ having at most one real conjugate and let $K$ be the algebraic number field ${\mathbf Q}(\alpha)$. For any unit $\epsilon$ of $K$ such that ${\mathbf Q}(\alpha\epsilon)=K$, we consider the irreducible polynomial $f_\epsilon(X)\in{\mathbf Z}[X]$ such that $f_\epsilon(\alpha\epsilon)=0$. Let $F_\epsilon(X,Y)\ = Ydf_\epsilon(X/Y)\in{\mathbf Z}[X,Y]$ be the associated binary form. For each positive integer $m$, we exhibit an effectively computable bound for the solutions $(x,y,\epsilon)$ of the diophantine equation $|F_\epsilon(x,y)|\leq m$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.