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

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we give an asymptotic formula with an error term, as $t\to+\infty$, for the number $N_t(Q,-k)$ of integral solutions $x\in\mathcal O^{n+1}$ of the equation $Q[x]=-k$ satisfying $|x_{n+1}|\leq t$.

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 positive number $C_F$ such that $R_F(Z)$ is asymptotic to $C_F Z^{\frac{2}{d}}$.

We consider systems $\vec{F}(\vec{x})$ of $R$ homogeneous forms of the same degree $d$ in $n$ variables with integral coefficients. If $n\geq d2^dR+R$ and the coefficients of $\vec{F}$ lie in an explicit Zariski open set, we give a nonsingular Hasse principle for the equation $\vec{F}(\vec{x})=\vec{0}$, together with an asymptotic formula for the number of solutions to in integers of bounded height. This improves on the number of variables needed in previous results for gener...

We show how to adapt the Hardy--Littlewood circle method to count monochromatic solutions to diagonal Diophantine equations. This delivers a lower bound which is optimal up to absolute constants. The method is illustrated on equations obtained by setting a diagonal quadratic form equal to a linear form. As a consequence, we determine an algebraic criterion for when such equations are partition regular. Our methods involve discrete harmonic analysis and require a number of `mi...

In this paper, we give several asymptotic formulas for the number of multiplicatively dependent vectors of algebraic numbers of fixed degree, or within a fixed number field, and bounded height.

In this paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number of solutions of the system when it is possible to aggregate the system into one equation.

Let $n$ be a positive integer. In this paper we estimate the size of the set of linear forms $b_1\log a_1 + b_2\log a_2+...+b_n\log a_n$, where $|b_i|\leq B_i$ and $1\leq a_i\leq A_i$ are integers, as $A_i,B_i\to \infty$.

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized substantially: first to a power sieve, counting $\mathbf{x} \in [-B,B]^n$ for which $f(\mathbf{x})=y^r$ is solvable for $y \in \mathbb{Z}$; then to a polynomial sieve, counting $\mathbf{x} \in [-B,B]^n$ for which $f(\mathbf{x})=g(y)$ is so...

We count integer points on bihomogeneous varieties using the Hardy-Littlewood method. The main novelty lies in using the structure of bihomogeneous equations to obtain asymptotics in generically fewer variables than would be necessary in using the standard approach for homogeneous varieties. Also, we consider counting functions where not all the variables have to lie in intervals of the same size, which arises as a natural question in the setting of bihomogeneous varieties.

Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any smooth and geometrically integral variety $X\subseteq \mathbb{P}_K^m$ satisfies the Hasse principle, weak approximation and the Manin-Peyre conjecture, if only its dimension is large enough compared to its degree. This generalizes work of Skin...