Related papers: Cubic Thue Equations

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…

By using the complete discrimination system for polynomials, we study the number of positive solutions in {\small $C[0,1]$} to the integral equation {\small $\phi (x)=\int_0^1k(x,y)\phi ^n(y)dy$}, where {\small…

Following a method originally due to Siegel, we establish upper bounds for the number of primitive integer solutions to inequalities of the shape $0<|F(x, y)| \leq h$, where $F(x , y) =(\alpha x + \beta y)^r -(\gamma x + \delta y)^r \in…

We show that for a large class of cubic polynomials $f$, every sufficiently large number can be written as a sum of seven positive values of $f$. As a special case, we show that every number greater than $e^{10^7}$ is a sum of seven…

Twisting a binary form $F_0(X,Y)\in{\mathbb{Z}}[X,Y]$ of degree $d\ge 3$ by powers $\upsilon^a$ ($a\in{\mathbb{Z}}$) of an algebraic unit $\upsilon$ gives rise to a binary form $F_a(X,Y)\in{\mathbb{Z}}[X,Y]$. More precisely, when $K$ is a…

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

Let $F$ be an irreducible binary form attached to a number field $K$ of degree $\geq 3$. Let $\epsilon\not\in \{-1, 1\}$ be a totally real unit of $K$. By twisting $F$ with the powers $\epsilon^a$ of $\epsilon$, ($a\in{\mathbf Z}$), we…

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…

E. Thomas was one of the first to solve an infinite family of Thue equations, when he considered the forms $F_n(X, Y )= X^3 -(n-1)X^2Y -(n+2)XY^2 -Y^3$ and the family of equations $F_n(X, Y )=\pm 1$, $n\in {\mathbf N}$. This family is…

We consider cubic forms $\phi_{a,b}(x,y,z) = ax^3 + by^3 - z^3$ with coefficients $a,b \in \mathbb{Z}$. We give an asymptotic formula for how many of these forms are locally soluble everywhere, i.e. we give an asymptotic formula for the…

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.

We study the solubility of cubic equations over the integers. Assuming a necessary congruence condition, the existence of such solutions is established when the $h$-invariant of $C$ is at least $14$, improving on work of Davenport-Lewis and…

We consider Diophantine equations of the kind $|F(x,y)|= m$, where $F(X,Y )\in \bz [X,Y]$ is a homogeneous polynomial of degree $d\ge 3$ that has non-zero discriminant and $m$ is a positive integer. We prove results that simplify those of…

Let $a,b,c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this paper, by analyzing the gap rule for solutions of the ternary purely exponential diophantine equation $a^x+b^y=c^z$, we prove that if $\max\{a,b,c\}\geq…

Given a binary quadratic form $F \in \mathbb{Z}[X, Y]$, we define its value set $F(\mathbb{Z}^2)$ to be $\{F(x, y) : (x, y) \in \mathbb{Z}^2\}$. If $F$ and $G$ are two binary quadratic forms with integer coefficients, we give necessary and…

For any fixed nonzero integer $h$, we show that a positive proportion of integral binary quartic forms $F$ do locally everywhere represent $h$, but do not globally represent $h$. We order classes of integral binary quartic forms by the two…

The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system…

Let $f(x_1,\ldots,x_n)$ be a regular indefinite integral quadratic form with $n\ge 9$, and let $t$ be an integer. It is established that $f(x_1,\ldots,x_n)=t$ has solutions in prime variables if there are no local obstructions.

An open problem of arithmetic Ramsey theory asks if given a finite $r$-colouring $c:\mathbb{N}\to\{1,...,r\}$ of the natural numbers, there exist $x,y\in \mathbb{N}$ such that $c(xy)=c(x+y)$ apart from the trivial solution $x=y=2$. More…