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.
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…
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.
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…
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…
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 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 $φ_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)$.
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…
We establish the analytic Hasse principle for Diophantine systems consisting of one diagonal form of degree $k$ and one general form of degree $d$, where $d$ is smaller than $k$. By employing a hybrid method that combines ideas from the study of general forms with techniques adapted to the diagonal case, we are able to obtain bounds that grow exponentially in $d$ but only quadratically in $k$, reflecting the growth rates typically obtained for both problems separately. We also discuss some of the most interesting generalisations of our approach.
Diophantine approximation with sums of two squares
Ramakrishna Mission Vivekananda Educational and Research Institute（罗摩克里希那使命维韦卡南达教育与研究所）；Indian Institute of Science Education & Research Kolkata（印度科学教育研究学院加尔各答分校）
Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of general norms, rather than the supremum norm, to quantify the approximation. In terms of homogeneous dynamics, the approximation properties of an $m \times n$ matrix are governed by a trajectory in $\mathrm{SL}_{m+n}({\mathbb R})/\mathrm{SL}_{m+n}({\mathbb Z})$ avoiding a compact subset of the space of lattices called the critical locus defined with respect to …
For any $\varepsilon > 0$ we derive effective estimates for the size of a non-zero integral point $m \in \mathbb{Z}^d \setminus \{0\}$ solving the Diophantine inequality $\lvert Q[m] \rvert < \varepsilon$, where $Q[m] = q_1 m_1^2 + \ldots + q_d m_d^2$ denotes a non-singular indefinite diagonal quadratic form in $d \geq 5$ variables. In order to prove our quantitative variant of the Oppenheim conjecture, we extend an approach developed by Birch and Davenport [BD58b] to higher dimensions combined with a theorem of Schlickewei [Sch85]. The result obtained is an optimal extension of Schlickewei's …
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.
