Related papers: Diophantine inequalities for generic ternary diago…

We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…

The search of solutions of the Diophantine equation $x^3 + y^3 + z^3 = k$ for $k<1000$ has been extended with bounds of $|x|$, $|y|$ and $|z|$ up to $10^{15}$. The first solution for $k=74$ is reported. This only leaves $k=33$ and $k=42$…

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…

We study properties of Diophantine exponents of lattices and so-called related "weak" uniform approximations introduced in recent papers by Oleg German, in the simplest two-dimensional case. In contrast to the multidimensional case, in the…

Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…

Following Schmidt, Thurnheer and Bugeaud-Kristensen, we study how Dirichlet's theorem on linear forms needs to be modified when one requires that the vectors of coefficients of the linear forms make a bounded acute angle with respect to a…

The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many…

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 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…

If $X$ is a smooth complex projective 3-fold with ample canonical divisor $K$, then the inequality $K^3\ge {2/3}(2p_g-7)$ holds, where $p_g$ denotes the geometric genus. This inequality is nearly sharp. We also give similar, but more…

We introduce and study a dimensional-like characteristic of an uniformly almost periodic function, which we call the Diophantine dimension. By definition, it is the exponent in the asymptotic behavior of the inclusio length. Diophantine…

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 +…

A set of m distinct positive integers {a_{1},...a_{m}} is called a Diophantine m-tuple if a_{i}a_{j}+n is a square for each 1\leqi<j\leqm . The aim of this study is to show that some P_{k} sets can not be extendible to a Diophantine…

We prove certain type symmetric inequalities in $\textbf{R}^{2}$ and $\textbf{R}^3$, that ocur in many problems of analysis. These inequalities are generalizations of the Jensen's inequality from one variable to two and three variables

We provide a mathematical framework for studying different versions of discontinuous Galerkin (DG) approaches for solving 2D Riemann-Liouville fractional elliptic problems on a finite domain. The boundedness and stability analysis of the…

In [1] it is shown that the Diophantine equation $(k!)^n+k^n=(n!)^k+n^k$ only has the trivial solution $n=k$, and $(k!)^n-k^n=(n!)^k-n^k$ only has the solutions $n=k$, $(n, k)=(1, 2),$ and $(2, 1)$. In this article we find all solutions of…

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$…

In this paper we obtain new parametric ideal solutions of the Tarry-Escott problem of degrees 2, 3 and 5, that is, of the diophantine systems $\sum_{i=1}^{k+1}x_i^j=\sum_{i=1}^{k+1}y_i^j,\;j=1,\,2,\,\dots,\,k$, when $k$ is 2, 3 or 5. When…