Related papers: Diophantine equations in moderately many variables

Let $X$ be an affine or a projective variety defined over a number field $K$ and $\varphi:{\bf C}\to X({\bf C})$ be a holomorphic map with Zariski dense image. We estimate the number of rational points of height bounded by $H$ in the image…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

In this extended abstract we deal with the relations between the numerical/diophantine approximation and the symbolic/algebraic geometry approachs to solving of multivariate diophentine polynomial systems, obtaining several consecuences…

We establish an asymptotic formula for the number of integral solutions of bounded height for pairs of diagonal quartic equations in $26$ or more variables. In certain cases, pairs in $25$ variables can be handled.

A semiprime is a natural number which is the product of two (not necessarily distinct) prime numbers. Let $F(x_1, \ldots, x_n)$ be a degree $d$ homogeneous form with integer coefficients. We provide sufficient conditions, similar to those…

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Let B_n={x_i \cdot x_j=x_k, x_i+1=x_k: i,j,k \in {1,...,n}}. For a positive integer n, let \xi(n) denote the smallest positive integer b such that for each system S \subseteq B_n with a unique solution in positive integers x_1,...,x_n, this…

An asymptotic formula for the number of prime solutions of a general diagonal system of Diophantine equations is established, contingent on the existence of an appropriate mean value bound and on local solvability. In conjunction with the…

In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in…

For a tuple $(\theta_1,..,\theta_M)$ of complex number, buliding on the approximation techniques in earlier papers of this series, this paper engages in deducing lower estimates on the transcendence degree of the field generated by…

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

Let $\sigma_{i}(x_{1},\ldots, x_{n})=\sum_{1\leq k_{1}<k_{2}<\ldots <k_{i}\leq n}x_{k_{1}}\ldots x_{k_{i}}$ be the $i$-th elementary symmetric polynomial. In this note we generalize and extend the results obtained in a recent work of Zhang…

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.

Let $\zeta$ be a real transcendental number. We introduce a new method to find upper bounds for the classical exponent $\widehat{w}_{n}(\zeta)$ concerning uniform polynomial approximation. Our method is based on the parametric geometry of…

Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…

A method is described to sum multi-dimensional arithmetic functions subject to hyperbolic summation conditions, provided that asymptotic formulae in rectangular boxes are available. In combination with the circle method, the new method is a…

In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a…

We obtain bounds on the average size of Bohr sets with coefficients parametrised by polynomials over finite fields and obtain a series of general results and also some sharper results for specific sets which are important for applications…

We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…