Related papers: The Diophantine problem for systems of algebraic e…

In this paper, we present efficient algorithms for solving the Diophantine equation $f(x, y) = m$ for an arbitrary definite binary quadratic form $f$, given the factorization of $m$. While Cornacchia's algorithm to solve $x^2 + dy^2 = m$ is…

In this work, we give upper bounds for $n$ on the title equation. Our results depend on assertions describing the precise exponents of $2$ and $3$ appearing in the prime factorization of $T_{k}(x)=(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}$. Further,…

In this paper we provide criteria for the insolvability of the Diophantine equation $x^2+D=y^n$. This result is then used to determine the class number of the quadratic field $\mathbb{Q}(\sqrt{-D})$. We also determine some criteria for the…

We show that a class of divergence-form elliptic problems with quadratic growth in the gradient and non-coercive zero order terms are solvable, under essentially optimal hypotheses on the coefficients in the equation. In addition, we prove…

Fix an integer $n\ge 2$. To each non-zero point $\mathbf{u}$ in $\mathbb{R}^n$, one attaches several numbers called exponents of Diophantine approximation. However, as Khintchine first observed, these numbers are not independent of each…

The aim of this paper is to study the obstacle problem with an elliptic operator having degenerate coercivity. We prove the existence of an entropy solution to the obstacle problem under the assumption of $L^{1}-$summability on the data.…

Let $X_r$ be a finite type Dynkin diagram, and $\ell$ be a positive integer greater than or equal to two. The $Y$-system of type $X_r$ with level $\ell$ is a system of algebraic relations, whose solutions have been proved to have…

Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of…

We study a class of fractional elliptic problems of the form $\Ds u= f(u)$ in the half space $\R^N_+:=\{x \in \R^N\::\: x_1>0\}$ with the complementary Dirichlet condition $u \equiv 0$ in $\R^N \setminus \R^N_+$. Under mild assumptions on…

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…

The equation $f^n+g^n=1$, $n\in\mathbb{N}$ can be regarded as the Fermat Diophantine equation over the function field. In this paper we study the characterization of entire solutions of some system of Fermat type functional equations by…

We prove a result on approximations to a real number $\theta$ by algebraic numbers of degree $\le 2$ in the case when we have information about the uniform Diophantine exponent $\hat{\omega}$ for the linear form $x_0 +\theta…

In 2016 J. Koenigsmann refined a celebrated theorem of J. Robinson by proving that $\mathbb Q\setminus\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is a polynomial $P(t,x_1,\ldots,x_{n})\in\mathbb Z[t,x_1,\ldots,x_{n}]$ such that…

Let $P(x):=a_d x^d+\cdots+a_0\in\mathbb{Q}[x]$, $a_d>0$, be a polynomial of degree $d\geq 2$. Let $(x_n)$ be a sequence of integers satisfying \begin{equation*} x_{n+1}=P(x_n)\mbox{for all}\quad n=0,1,2\ldots,\quad\mbox{and} \quad…

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…

In this paper we are mainly concerned with nontrivial positive solutions to the Dirichlet problem for the degenerate elliptic equation \begin{gather} -\frac{\partial^2 u}{\partial x^2} -\left|x\right|^{2k}\frac{\partial^2 u}{\partial…

Complex linear differential equations with entire coefficients are studied in the situation where one of the coefficients is an exponential polynomial and dominates the growth of all the other coefficients. If such an equation has an…

A Piatetski-Shapiro sequence with exponent $\alpha$ is a sequence of integer parts of $n^\alpha$ $(n = 1,2,\ldots)$ with a non-integral $\alpha > 0$. We let $\mathrm{PS}(\alpha)$ denote the set of those terms. In this article, we study the…

Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…

We shall show that, for any positive integer $D>0$ and any primes $p_1, p_2$ not dividing $D$, the diophantine equation $x^2+D=2^s p_1^k p_2^l$ has at most $63$ integer solutions $(x, k, l, s)$ with $x, k, l\geq 0$ and $s\in \{0, 2\}$.