Related papers: Cubic Thue inequalities with positive discriminant

We give an upper bound for the minimum $s$ with the property that every sufficiently large integer can be represented as the sum of $s$ positive $k$-th powers of integers represented as the sum of three positive cubes for the cases $2\leq…

We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y+1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.

Inspired by a recent pointwise differential inequality for positive bounded solutions of the fourth-order H\'enon equation $\Delta^2 u = |x|^a u^p$ in ${\mathbb R}^n$ with $a \geqslant 0$, $p > 1$, $n \geqslant 5$ due to Fazly, Wei, and Xu…

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

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.

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…

In this note, we use integral binary cubic forms to study the rational cube sum problem. We prove (unconditionally) that for any positive integer $d$, infinitely many primes in each of the residue classes $ 1 \pmod {9d}$ as well as $ -1…

We obtain an essentially optimal estimate for the moment of order 32/3 of the exponential sum having argument $\alpha x^3+\beta x^2$. Subject to modest local solubility hypotheses, we thereby establish that pairs of diagonal Diophantine…

In 1946 Fine and Niven posed problem E724, asking to demonstrate that every hypercube can be tiled by any number of hypercubic tiles larger than some value. This requires only basic number theory, but the problem of finding the smallest…

This paper studies two classical inequalities, namely the Hausdorff-Young inequality and equal-exponent Young's convolution inequality, for discrete functions supported in the binary cube $\{0,1\}^d\subset\mathbb{Z}^d$. We characterize the…

The equidistribution of roots of quadratic congruences with prime moduli depends crucially upon effective bounds for a special Weyl linear form. Duke, Friedlander and Iwaniec discovered a strong estimate for this Weyl linear form when the…

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

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…

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.

In order to obtain solutions to problem $$ {{array}{c} -\Delta u=\dfrac{A+h(x)} {|x|^2}u+k(x)u^{2^*-1}, x\in {\mathbb R}^N, u>0 \hbox{in}{\mathbb R}^N, {and}u\in {\mathcal D}^{1,2}({\mathbb R}^N), {array}. $$ $h$ and $k$ must be chosen…

In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where…

We prove existence of positive solutions to a boundary value problem depending on discrete fractional operators. Then, corresponding discrete fractional Lyapunov-type inequalities are obtained.