English
Related papers

Related papers: Thue's inequalities and the hypergeometric method

200 papers

Let $r,h\in\mathbb{N}$ with $r\geq 7$ and let $F(x,y)\in \mathbb{Z}[x ,y]$ be a binary form such that \[ F(x , y) =(\alpha x + \beta y)^r -(\gamma x + \delta y)^r, \] where $\alpha$, $\beta$, $\gamma$ and $\delta$ are algebraic constants…

Number Theory · Mathematics 2022-04-27 N. Saradha , Divyum Sharma

We will use Thue-Siegel method, based on Pad\'e approximation via hypergeometric functions, to give upper bounds for the number of integral solutions to the equation $|F(x, y)| = 1$ as well as the inequalities $|F(x, y)| \leq h$, for a…

Number Theory · Mathematics 2015-05-13 Shabnam Akhtari

Let $F(x,y)$ be an irreducible form of degree $r\geq 3$ and having $s+1$ non-zero coefficients. Let $h\geq 1$ be an integer and consider the Thue inequality $$|F(x,y)|\leq h.$$ Following the seminal work of Thue in 1909, several papers were…

Number Theory · Mathematics 2025-05-23 N. Saradha , Divyum Sharma

We establish some upper bounds for the number of integer solutions to the Thue inequality $|F(x , y)| \leq m$, where $F$ is a binary form of degree $n \geq 3$ and with non-zero discriminant $D$, and $m$ is an integer. Our upper bounds are…

Number Theory · Mathematics 2015-08-17 Shabnam Akhtari

Let $F(x, y)$ be a binary form with integer coefficients, degree $n\geq 3$ and irreducible over the rationals. Suppose that only $s + 1$ of the $n + 1$ coefficients of $F$ are nonzero. We show that the Thue inequality $|F(x,y)|\leq m$ has…

Number Theory · Mathematics 2020-08-26 Paloma Bengoechea

The Thue-Siegel method is applied to derive an upper bound for the number of solutions to Thue's equation $F(x,y) = 1$ where $F$ is a quartic diagonalizable form with negative discriminant. Computation is used in this argument to handle…

Number Theory · Mathematics 2019-02-20 Christophe Dethier

We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided…

Number Theory · Mathematics 2013-07-23 Shabnam Akhtari

In this paper, Thue's Fundamentaltheorem is analysed. We show that it includes, and often strengthens, known effective irrationality measures obtained via the so-called hypergeometric method as well as showing that it can be applied to…

Number Theory · Mathematics 2012-02-01 Paul Voutier

Let $F(x,y)$ be an irreducible binary form of degree $\geq 3$ with integer coefficients and with real roots. Let $M$ be an imaginary quadratic field, with ring of integers $Z_M$. Let $K>0$. We describe an efficient method how to reduce the…

Number Theory · Mathematics 2018-10-22 István Gaál , Borka Jadrijević , László Remete

Let $t$ be any imaginary quadratic integer with $|t|\geq 100$. We prove that the inequality \[ |F_t(X,Y)| = | X^4 - t X^3 Y - 6 X^2 Y^2 + t X Y^3 + Y^4 | \leq 1 \] has only trivial solutions $(x,y)$ in integers of the same imaginary…

Let A be an arbitrary integral domain of characteristic 0 which is finitely generated over Z. We consider Thue equations $F(x,y)=b$ with unknowns x,y from A and hyper- and superelliptic equations $f(x)=by^m$ with unknowns from A, where the…

Number Theory · Mathematics 2023-09-19 Attila Bérczes , Jan-Hendrik Evertse , Kálmán Györy

In this paper, we prove that a Thue equation F(x,y) = h, where h is an integer and F is a polynomial of degree n with integer coefficients and without repeated roots, has at most 2n^3 - 2n - 3 solutions provided that the Mordell-Weil rank…

Number Theory · Mathematics 2007-05-23 Dino Lorenzini , Thomas J. Tucker

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…

Number Theory · Mathematics 2022-06-29 Anton Mosunov

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the…

Number Theory · Mathematics 2022-07-19 Shabnam Akhtari , Paloma Bengoechea

We obtain a polynomial type upper bound for the size of the integral solutions of Thue equations $F(X,Y) = b$ defined over a totally real number field $K$, assuming that $F(X,1)$ has a root $\alpha$ such that $K(\alpha)$ is a CM-field.…

Number Theory · Mathematics 2015-01-08 Yves Aubry , Dimitrios Poulakis

Let $F(X,Y)=\sum\limits_{i=0}^sa_iX^{r_i}Y^{r-r_i}\in\mathbb{Z}[X,Y]$ be a form of degree $r=r_s\geq 3$, irreducible over $\mathbb{Q}$ and having at most $s+1$ non-zero coefficients. Mueller and Schmidt showed that the number of solutions…

Number Theory · Mathematics 2016-03-23 N. Saradha , Divyum Sharma

A Thue-Mahler equation is a Diophantine equation of the form $$F(X,Y) = a\cdot p_1^{z_1}\cdots p_v^{z_v}, \qquad \gcd(X,Y)=1$$ where $F$ be an irreducible homogeneous binary form of degree at least $3$ with integer coefficients, $a$ is a…

Number Theory · Mathematics 2025-03-26 Adela Gherga , Samir Siksek

In 1908 Thue (1) showed that algebraic numbers of the special form $\xi =\sqrt[n]{\frac{a}{b}}$ can, for every positive $\epsilon$, only be sharply approximated by finitely many rational numbers $\frac{p}{q}$ with the following inequality…

History and Overview · Mathematics 2025-08-26 Kurt Mahler

A solution $(x,y,z) \in \mathbb{Z}^3-\{(0,0,0)\}$ to a generalized Fermat equation \[ Ax^a + By^b + Cz^c = 0, \] is called \emph{primitive} if $\gcd(x,y,z) = 1$. By work of Beukers, we know that in the \emph{spherical} regime (that is, when…

Number Theory · Mathematics 2026-05-28 Santiago Arango-Piñeros

We exactly determine the integral solutions to a previously untreated infinite family of cubic Thue equations of the form $F(x,y)=1$ with at least $5$ such solutions. Our approach combines elementary arguments, with lower bounds for linear…

Number Theory · Mathematics 2014-02-11 Michael A. Bennett , Amir Ghadermarzi
‹ Prev 1 2 3 10 Next ›