Related papers: Diophantine equations in moderately many variables

Let $\alpha$ be an algebraic number of degree $d\ge 3$ and let $K$ be the algebraic number field $\Q(\alpha)$. When $\varepsilon$ is a unit of $K$ such that $\Q(\alpha\varepsilon)=K$, we consider the irreducible polynomial $f_\varepsilon(X)…

We extend work of Heath-Brown and Salberger, based on the determinant method, to provide a uniform upper bound for the number of integral points of bounded height on an affine surface, which are subject to a polynomial congruence condition.…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

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…

The main idea of this article is simply calculating integer functions in module. The algebraic in the integer modules is studied in completely new style. By a careful construction, a result is proven that two finite numbers is with unequal…

In this paper, an upper bound for the number of integral points of bounded height on an affine complete intersection defined over $\mathbb{Z}$ is proven. The proof uses an extension to complete intersections of the method used for…

Let $\F$ be a family of $r$ integral forms of degree $k\geq 2$ and $\LL=(l_1,\ldots,l_m)$ be a family of pairwise linearly independent linear forms in $n$ variables $\x=(x_1,...,x_n)$. We study the number of solutions $\x\in[1,N]^n$ to the…

We obtain a more precise version of an asymptotic formula of A. Dubickas for the number of monic Eisenstein polynomials of fixed degree $d$ and of height at most $H$, as $H\to \infty$. In particular, we give an explicit bound for the error…

We prove uniform upper bounds on the number of integral points of bounded height on affine varieties. If $X$ is an irreducible affine variety of degree $d\geq 4$ in $\mathbb{A}^n$ which is not the preimage of a curve under a linear map…

We compute the Hausdorff dimension of the set of simultaneously $q^{-\lambda}$-well approximable points on the Veronese curve in $\mathbb{R}^n$ for $\lambda$ between $\frac{1}{n}$ and $\frac{2}{2n-1}$. For $n=3$, the same result is given…

We use the circle method to count the number of integer solutions to systems of bihomogeneous equations of bidegree $(1,1)$ and $(2,1)$ of bounded height in lopsided boxes. Previously, adjusting Birch's techniques to the bihomogeneous…

Using the Davenport-Heilbronn circle method, we show that for almost all additive Diophantine inequalities of degree $k$ in more than $2k$ variables the expected asymptotic formula for the density of solutions holds true. This appears to be…

This article discusses the question - how to estimate the number of solutions of algebraic Diophantine equations with natural coefficients using Circular method developed by Hardy and Littlewood. This paper considers the estimate of the…

Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded integer domains it remains classically intractable in the…

Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…

We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1},\ldots, a_{k}$ satisfying the conditions $k\geq 2$ and $a_{i}<a_{i+1}$ for…