Related papers: Differences between perfect powers : the Lebesgue-…
Perfect error correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory.…
In Diophantine approximation, inhomogeneous problems are linked with homogeneous ones by means of the so-called Transference Theorems. We revisit this classical topic by introducing new exponents of Diophantine approximation. We prove that…
We consider the Diophantine equation $x^4 + y^4 - w^2 = n$ for $n \in \mathbb{Z}$, which is related to near misses for the quartic case of Fermat's Last Theorem. For certain $n$ we show that the set of solutions is infinite, or more…
The primary goal of this paper is to complete the theory of metric Diophantine approximation initially developed in [Ann. of Math.(2) 166 (2007), p.367-426] for $C^3$ non-degenerate planar curves. With this goal in mind, here for the first…
We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…
We study the density of solutions to Diophantine inequalities involving non-singular ternary forms, or equivalently, the density of rational points close to non-singular plane algebraic curves.
We consider the Dirichlet problem for a class of elliptic and parabolic equations in the upper-half space $\mathbb{R}^d_+$, where the coefficients are the product of $x_d^\alpha, \alpha \in (-\infty, 1),$ and a bounded uniformly elliptic…
In this paper, we consider the exponential Diophantine equation \( (2^k-1)(b^k-1)=y^q \) with $k\ge 2$, odd integer $b$ and an odd prime exponent $q$ and obtain effective upper bounds for $q$ in terms of $b$. In particular, we show that…
In this paper, by using the elliptic curves theory, we study the fourth power Diophantine equation ${ \sum_{i=1}^n a_ix_{i} ^4= \sum_{j=1}^na_j y_{j}^4 }$, where $a_i$ and $n\geq3$ are fixed arbitrary integers. We solve the equation for…
We consider the problem of obtaining higher order in regularization parameter $\epsilon$ analytical results for master integrals with elliptics. The two commonly employed methods are provided by the use of differential equations and direct…
The title equation is completely solved in integers $(n,x,y,a,b)$, where $n\geq 3$, $\gcd(x,y)=1$ and $a,b\geq 0$. The most difficult stage of the resolution is the explicit resolution of a quintic Thue-Mahler equation. Since it is for the…
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…
A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…
In this paper, we explore several threads arising from our recent joint work on arithmetic holonomy bounds, which were originally devised to prove new irrationality results based on the method of Ap\'ery limits. We propose a new method to…
The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For $n=2$ such a procedure is well known, when new variables are components of spinors and they are widely used…
In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem,…
Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…
We study which integers are admissible as Fourier coefficients of even integer weight newforms. In the specific case of the tau-function, we show that for all odd primes $\ell < 100$ and all integers $m \geq 1$, we have $$ \tau(n) \neq \pm…
In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…
Let $k,l\geq2$ be fixed integers. In this paper, firstly, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(lx)^{k}=y^{n}$ in integers $x,y,n$ with $x,y\geq1, n\geq2$ satisfy $n<C_{1}$ where $C_{1}=C_{1}(l,k)$ is an…