We obtain asymptotic upper bounds for the number of natural solutions of the following diagonal Diophantine equations in a hypercube with side - $N$ in the paper:
$x_1 = x_2^k+...+x_s^k$,
$x_1^k = x_2^k+...+x_s^k$,
$x_1 = \sum_{j=2}^s {x_j}^{k_j}$, where $k,s,k_j$ are the natural numbers.
The author showed that any homogeneous algebraic Diophantine equation of the second order can be converted to a diagonal form using an integer non-orthogonal transformation maintaining asymptotic behavior of the number of its integer solutions. In this paper, we consider the transformation to the diagonal form of a wider class of algebraic second-order Diophantine equations, and also we consider the conditions for converting higher order algebraic Diophantine equations to this form. The author found an asymptotic estimate for the number of integer solutions of the diagonal Thue equation of odd…
This paper investigates the upper bound of the number of integer (natural) solutions of inhomogeneous algebraic Diophantine diagonal equations with integer coefficients without a free member via the circle method of Hardy and Littlewood. Author found the upper bound of the number of natural solutions of inhomogeneous algebraic Diophantine diagonal equations with explicit variable. He developed a method in the paper, which allows you to perform the low estimate of the number of natural (integer) solutions of algebraic Diophantine equation with integer coefficients. Author obtained a lower estim…
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 versatile tool to count rational points on algebraic varieties defined by multi-homogeneous diagonal equations.
Let k\geq 2 and consider the Diophantine inequality |x_1^k-\alp_2 x_2^k-\alp_3 x_3^k| <\tet. Our goal is to find non-trivial solutions in the variables x_i, 1\leq i\leq 3, all of size about P, assuming that \tet is sufficiently large. We study this problem on average over \alp_3 and generalize previous work of Bourgain on quadratic ternary diagonal forms to general degree k.
Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer coefficients. It was found the lower estimate of the number of natural solutions to various types of homogeneous algebraic Diophantine equations with integer coefficients diagonal form with any number of variables using this method. Author obtained upper bound of the number of the natural solutions (using CM) of one type of homogeneous Diophantine equation for val…
The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for algebraic Diophantine equation. The author shows the properties of this transformation and he receives the algorithm for finding the matrix elements of a generalized integer orthogonal transformation for algebraic Diophantine equation of the second order to diagonal form. The article includes examples illustrating the reduction of algebraic equations of the s…
The paper assesses the top number of integer solutions for algebraic Diophantine Thue diagonal equation of the degree $n \geq 2$ and number of variables $k > 2$ and equations with explicit variable in the case when the coefficients of the equation are of the opposite signs. The author found integer conversions that maintain the asymptotic behavior of the number of integer solutions of algebraic Diophantine equation in the case of the conversion equation to diagonal form. The paper considers the estimation of the number of integer solutions for some types of algebraic Diophantine equations with…
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 `mixed' restriction estimates, which may be of independent interest.
By examining the 3 surface angles which exist at any of the 8 vertices of a Diophantine parallelepiped, and classifying them by the appearance of a right angle, it is discovered that 5 unique classes of Diophantine parallelepipeds exist. It is proposed to name these classes: acute (triclinic), obtuse (triclinic), 1-ortho (biclinic), 2-ortho (monoclinic), and rectangular, according to the count of rights angles which may exist. A Diophantine analysis of the 83 possible rational components of the piped reveals that only 27 rationality checks need to be made when examining for rationality; such a…
In this note we consider Diophantine equations of the form \begin{equation*} a(x^p-y^q) = b(z^r-w^s), \quad \mbox{where}\quad \frac{1}{p}+\frac{1}{q}+\frac{1}{r}+\frac{1}{s}=1, \end{equation*} with even positive integers $p,q,r,s$. We show that in each case the set of rational points on the underlying surface is dense in the Zariski topology. For the surface with $(p,q,r,s)=(2,6,6,6)$ we prove density of rational points in the Euclidean topology. Moreover, in this case we construct infinitely many parametric solutions in coprime polynomials. The same result is true for $(p,q,r,s)\in\{(2,4,8,8)…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. Such cuboids are not yet discovered and their non-existence is also not proved. Perfect Euler cuboids are described by a system of four Diophantine equation possessing a natural $S_3$ symmetry. Recently these equations were factorized with respect to this $S_3$ symmetry and the factor equations were derived. In the present paper the factor equations are transformed to $E$-form and then reduced to a single biquadratic equation.
We prove analogues of some classical results from Diophantine approximation and metric number theory (namely Dirichlet's theorem and the Duffin--Schaeffer theorem) in the setting of diagonal Diophantine approximation, i.e. approximating elements of $\mathbb{R} \times \mathbb{Q}_{p_1} \times \cdots \times \mathbb{Q}_{p_r}$ by elements of the diagonal embedding of $\mathbb{Q}$ into this space.
Let a1,..., a9 be non-zero integers and n any integer. Suppose that a1 + ... + a9 = n (mod 2) and (ai, aj) = 1 for 1 <= i < j <= 9. We will prove that (i) if not all of the aj's are of the same sign, then the cubic diagonal equation a1p1^3 + ... + a9p9^3 = n has prime solutions satisfying pj << n^{1/3} + max{|aj|}^{20+ e}; and (ii) if all aj are positive and n >> max{|aj|}^{61+e}, then the cubic diagonal equation a1p1^3 + ... + a9p9^3 = n is soluble in primes pj. This result is motivated from the analogous result for quadratic diagonal equations by S.K.K. Choi and J. Liu. To prove the results …
The problem of finding all possible extensions of a given rational diophantine quadruple to a rational diophantine quintuple is equivalent to the determination of the set of rational points on a certain curve of genus 5 that can be written as an intersection of three diagonal quadrics in $\mathbb P^4$. We discuss how one can (try to) determine the set of rational points on such a curve. We apply our approach to the original question in several cases. In particular, we show that Fermat's diophantine quadruple (1,3,8,120) can be extended to a rational diophantine quintuple in only one way, namel…
We show that Artin's conjecture concerning p-adic solubility of Diophantine equations fails for infinitely many systems of r homogeneous diagonal equations whenever r>1.
We apply Freeman's variant of the Davenport-Heilbronn method to investigate the exceptional set of real numbers not close to some value of a given real diagonal form at an integral argument. Under appropriate conditions, we show that the exceptional set in the interval [-N,N] has measure O(N^{1-c}), for a positive number c.
Let $φ_1,\ldots ,φ_r\in \mathbb Z[z_1,\ldots z_k]$ be integral linear combinations of elementary symmetric polynomials with $\text{deg}(φ_j)=k_j$ $(1\le j\le r)$, where $1\le k_1<k_2<\ldots <k_r=k$. Subject to the condition $k_1+\ldots +k_r\ge \tfrac{1}{2}k(k-1)+2$, we show that there is a paucity of non-diagonal solutions to the Diophantine system $φ_j(\mathbf x)=φ_j(\mathbf y)$ $(1\le j\le r)$.
A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical problem. Algebraically the problem is described by a system of Diophantine equations. Symmetry approach to the cuboid problem is based on the natural $S_3$ symmetry of its Diophantine equations. Factorizing these equations with respect to their $S_3$ symmetry, one gets some certain ideal within the ring of multisymmetric polynomials. In the present paper this i…
This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ θ,$ where $ θ>2$ is real and non-integral. For fixed non-zero real numbers $ λ_i $ not all of the same sign we write \begin{equation*} \mathcal F (\textbf{x}) = λ_1 x_1^θ+ \cdots + λ_s x_s^θ. \end{equation*} For a fixed positive real number $ τ$ we give an asymptotic formula for the number of positive integer solutions of the inequality $ | \mathcal F (\textbf{x}) | < τ$ inside a box of side length $P.$ Moreover, we investigate the problem of representing a large positive real number by a positiv…
A perfect cuboid is a rectangular parallelepiped whose edges, whose face diagonals, and whose space diagonal are of integer lengths. The second cuboid conjecture specifies a subclass of perfect cuboids described by one Diophantine equation of tenth degree and claims their non-existence within this subclass. This Diophantine equation is called the cuboid characteristic equation. It has two parameters. The linear region is a domain on the coordinate plane of these two parameters given by certain linear inequalities. In the present paper asymptotic expansions and estimates for roots of the charac…
A perfect cuboid is a rectangular parallelepiped. Its edges, its face diagonals, and its space diagonal are of integer lengths. None of such cuboids is known thus far, though the system of Diophantine equations describing them is easily written. The cuboid characteristic equation is a twelfth degree Diophantine equation derived from the initial cuboid equations and equivalent to them. In the case of the second cuboid conjecture it reduces to a tenth degree equation. This equation comprises two parameters. Previously various asymptotics for roots of this equation were studied as its parameters …
A perfect cuboid is a rectangular parallelepiped whose edges, whose face diagonals, and whose space diagonal are of integer lengths. The second cuboid conjecture specifies a subclass of perfect cuboids described by one Diophantine equation of tenth degree and claims their non-existence within this subclass. This Diophantine equation has two parameters. Previously asymptotic expansions and estimates for roots of this equation were obtained in the case where the first parameter is fixed and the other tends to infinity. In the present paper reverse asymptotic expansions and estimates are derived …
The present paper is concerned with equidistribution results for certain flows on homogeneous spaces and related questions in Diophantine approximation. Firstly, we answer in the affirmative, a question raised by Kleinbock, Shi and Weiss regarding equidistribution of orbits of arbitrary lattices under diagonal flows and with respect to unbounded functions. We then consider the problem of Diophantine approximation with respect to rationals in a fixed number field. We prove a number field analogue of a famous result of W. M.Schmidt which counts the number of approximates to Diophantine inequalit…
We investigate the geometry of approximates in multiplicative Diophantine approximation. Our main tool is a new multiparameter averaging result for Siegel transforms on the space of unimodular lattices in ${\mathbb R}^n$ which is of independent interest.
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the natural measure) contains all finite patterns (hence is well approximable). Similarly, we show that for a variety of fractals in [0,1]^2, possessing some symmetry, almost any point is not Dirichlet improvable (hence is well approximable) and has property C (after Cassels). We then settle by similar methods a conjecture of M. Boshernitzan saying that there are no …
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved mathematical problem. The Diophantine equations of a perfect Euler cuboid have an explicit $S_3$ symmetry. In this paper the cuboid equations are factorized with respect to their $S_3$ symmetry in terms of multisymmetric polynomials. Some factor equations are calculated explicitly.
Our aim is to find a complex continued fraction algorithm finding all the best Diophantine approximations to a complex number. Using the sequence of minimal vectors in a two dimensional lattice over Gaussian integers, we obtain an algorithm defined on a submanifold of the space of unimodular two dimensional Gauss lattices. This submanifold is transverse to the diagonal flow. Thanks to the correspondence between minimal vectors and best Diophantine approximations, the algorithm finds all the best approximations to a complex number. A byproduct of the algorithm is the best constant for the compl…
We prove that almost any pair of real numbers a,b, satisfies the following inhomogeneous uniform version of Littlewood's conjecture: (*) forall x,y in R, liminf_{|n|\to\infty} |n|<na - x> <nb - y> = 0, where <-> denotes the distance from the nearest integer. The existence of even a single pair that satisfies (*), solves a problem of Cassels from the 50's. We then prove that if 1,a,b span a totally real number field, then a,b, satisfy (*). It is further shown that if 1,a,b, are linearly dependent over Q, a,b cannot satisfy (*). The results are then applied to give examples of irregular orbit cl…
A perfect cuboid is a rectangular parallelepiped with integer edges, integer face diagonals, and integer space diagonal. Such cuboids have not yet been found, but nor has their existence been disproved. Perfect cuboids are described by a certain system of Diophantine equations possessing an intrinsic $S_3$ symmetry. Recently these equations were factorized with respect to this $S_3$ symmetry and the factor equations were transformed into $E$-form. As appears, the transformed factor equations are explicitly solvable. Based on this solution, polynomial inverse problems are formulated in the pres…
We investigate pairs of diagonal cubic equations with integral coefficients. For a class of such Diophantine systems with 11 or more variables, we are able to establish that the number of integral solutions in a large box is at least as large as the expected order of magnitude.
The determination of Jacobi sums, their congruences and cyclotomic numbers have been the object of attention for many years and there are large number of interesting results related to these in the literature. This survey aims at reviewing results concerning the diophantine systems for finding the cyclotomic numbers and coefficients of Jacobi sums and to indicate the current status of the problem.
An Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals. An Euler cuboid is called perfect if its space diagonal is also integer. Some Euler cuboids are already discovered. As for perfect cuboids, none of them is currently known and their non-existence is not yet proved. Euler cuboids and perfect cuboids are described by certain systems of Diophantine equations. These equations possess an intrinsic $S_3$ symmetry. Recently they were factorized with respect to this $S_3$ symmetry and the factor equations were derived. In the present paper the factor equatio…
We establish improved mean value estimates associated with the number of integer solutions of certain systems of diagonal equations, in some instances attaining the sharpest conjectured conclusions. This is the first occasion on which bounds of this quality have been attained for Diophantine systems not of Vinogradov type. As a consequence of this progress, whenever $u \ge 3v$ we obtain the Hasse principle for systems consisting of $v$ cubic and $u$ quadratic diagonal equations in $6v+4u+1$ variables, thus attaining the convexity barrier for this problem.
Integer cuboids are rectangular Diophantine parallelepipeds It has been discovered that these cuboids come in 3 varieties: Euler or body type, edge type, and face type. In all three cases, one edge or diagonal is irrational, all six others are rational. We discuss an exhaustive computer search procedure which uses the Pythagorean group Py(n) to locate all possible cuboids with a given edge n. Over the range of 44 to 200,000,000,027 for the smallest edge, 167,043 cuboids were discovered. They are listed in the Integer Cuboid Table.
We consider the Diophantine equation X^n - 1 = B.Z^n, where B in Z is understood as a parameter. We prove that if the equation has a solution, then either the Euler totient of the radical, phi(rad (B)), has a common divisor with the exponent n, or the exponent is a prime and the solution stems from a solution to the diagonal case of the Nagell-Ljunggren equation: (X^n-1)/(X-1) = n^e.Y^n; e = 0 or 1. This allows us to apply recent results on this equation to the binary Thue equation in question. In particular, we can then display parametrized families for which the Thue equation has no solution…