Asymptotic estimates for the number of integer solutions to decomposable form inequalities

The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be the solution of the algebraic equations of the first, second and higher orders in two or more variables, non-algebraic Diophantine equations and systems of Diophantine equations in the domain of the natural numbers. The estimate for the nu...

In this article, we study the number of solutions of bounded height to certain multiplicative Diophantine equations. We provide a framework on counting the number of integer solutions of such equations in an orthotope. As a consequence of our main result, we derive an effective asymptotic formula for high power moments of certain restricted divisor functions. We additionally derive an asymptotic formula for the number of singular $2\times2$ matrices with integer entries, impr...

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for various cases, although in general there is a logarithmic gap between lower and upper bounds.

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error terms in our formulas are of various strengths depending on the Diophantine properties of the leading coefficients of these polynomials.

We consider a system of integer polynomials of the same degree with non-singular local zeros and in many variables. Generalising the work of Birch (1962) we find quantitative asymptotics (in terms of the maximum of the absolute value of the coefficients of these polynomials) for the number of integer zeros of this system within a growing box. Using a quantitative version of the Nullstellensatz, we obtain a quantitative strong approximation result, i.e. an upper bound on the s...

We study the number of representations of an integer n=F(x_1,...,x_s) by a homogeneous form in sufficiently many variables. This is a classical problem in number theory to which the circle method has been succesfully applied to give an asymptotic for the number of such representations where the integer vector (x_1,...,x_s) is restricted to a box of side length P for P sufficiently large. In the special case of Waring's problem, Vaughan and Wooley have recently established for...

We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.

Let $F_1,\dotsc,F_R$ be quadratic forms with integer coefficients in $n$ variables. When $n\geq 9R$ and the variety $V(F_1,\dotsc,F_R)$ is a smooth complete intersection, we prove an asymptotic formula for the number of integer points in an expanding box at which these forms simultaneously vanish, which in particular implies the Hasse principle for $V(F_1,\dotsc,F_R)$. Previous work in this direction required $n$ to grow at least quadratically with $R$. We give a similar resu...

We prove a new quantitative result on the degeneracy of the dimension of the subspace spanned by the best Diophantine approximations for a linear form.

We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by generalising an approach due to Heath-Brown, using a certain $q$-analogue of van der Corput's method, to the case of systems of polynomials of differing degree. Our results apply for a wider range of $n$, in terms of the degrees of the polynomi...