Related papers: Representation of integers by sparse binary forms

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…

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

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…

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…

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

In 2001 Thunder gave an estimate for the number of integer solutions of decomposable form inequalities under the assumption that the forms are of finite type. The purpose of this article is to generalize this result to forms which are of…

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

For a large class (heuristically most) of irreducible binary cubic forms $F(x,y) \in \mathbb Z[x,y]$, Bennett and Dahmen proved that the generalized superelliptic equation $F(x,y)=z^l$ has at most finitely many solutions in $x,y \in \mathbb…

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…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d \geq 3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. In 2019 Stewart and Xiao proved that…

In this note we show that for a given irreducible binary quadratic form $f(x,y)$ with integer coefficients, whenever we have $f(x,y) = f(u,v)$ for integers $x,y,u,v$, there exists a rational automorphism of $f$ which sends $(x,y)$ to…

Let $ T_{P } f (x) = \int e ^{i P (y)} K (y) f (x-y) \; dy $, where $ K (y)$ is a smooth Calder\'on-Zygmund kernel on $ \mathbb R ^{n}$, and $ P$ be a polynomial. We show that there is a sparse bound for the bilinear form $ \langle T_P f, g…

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d$ with $d$ at least $3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. We prove that there is a…

Given an integral indefinite binary Hermitian form f over an imaginary quadratic number field, we give a precise asymptotic equivalent to the number of nonequivalent representations, satisfying some congruence properties, of the rational…

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…

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…

For polynomial $ P (x,y)$, and any Calder\'{o}n-Zygmund kernel, $K$, the operator below satisfies a $ (1,r)$ sparse bound, for $ 1< r \leq 2$. $$ \sup _{\epsilon >0} \Bigl\lvert \int_{|y| > \epsilon} f (x-y) e ^{2 \pi i P (x,y) } K(y) \; dy…

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…

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…