Related papers: Efficient resolution of Thue-Mahler equations
Thue equations and their relative and inhomogeneous extensions are well known in the literature. There exist methods, usually tedious methods, for the complete resolution of these equations. On the other hand our experiences show that such…
We consider a parametrised family of Thue equations, \[ (x-G_1(n)\, y) \cdots (x-G_d(n)\, y) - y^d = \pm 1, \] which was first considered by Thomas to have an explicit set of solutions for parameters $n$ larger than some effectively…
We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $a\sigma(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath…
In this paper, we present a new method for variable elimination in systems of inequations which is much faster than the Fourier-Motzkin Elimination (FME) method. In our method, a linear Diophantine problem is introduced which is dual to our…
In this paper, for any odd $n$ and any integer $m\geq1$ with $n>4m$, we study the fundamental solution of the higher order Schr\"{o}dinger equation \begin{equation*} \mathrm{i}\partial_tu(x,t)=((-\Delta)^m+V(x))u(x,t),\quad t\in…
E. Thomas was one of the first to solve an infinite family of Thue equations, when he considered the forms $F_n(X, Y )= X^3 -(n-1)X^2Y -(n+2)XY^2 -Y^3$ and the family of equations $F_n(X, Y )=\pm 1$, $n\in {\mathbf N}$. This family is…
We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…
In this paper, we consider the exponential Diophantine equation $a^{x}+b^{y}=c^{z},$ where $a, b, c$ be relatively prime positive integers such that $a^{2}+b^{2}=c^{r}, r\in Z^{+}, 2\mid r$ with $b$ even. That is $$a=\mid…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…
A scalar integer partition problem asks for a number of nonnegative integer solutions to a linear Diophantine equation with integer positive coefficients. The manuscript discusses an algorithm of derivation of linear relations involving the…
In the first part we construct algorithms which we apply to solve S-unit, Mordell, cubic Thue, cubic Thue-Mahler and generalized Ramanujan-Nagell equations. As a byproduct we obtain alternative practical approaches for various classical…
This paper derives a free analog of the Euler-Maruyama method (fEMM) to numerically approximate solutions of free stochastic differential equations (fSDEs). Simply speaking fSDEs are stochastic differential equations in the context of…
Let $\ell$ and $p$ be (not necessarily distinct) prime numbers and $F$ be a global function field of characteristic $\ell$ with field of constants $\kappa$. Assume that there exists a prime $P_\infty$ of $F$ which has degree $1$, and let…
Suppose that $F(x)\in\mathbb{Z}[[x]]$ is a Mahler function and that $1/b$ is in the radius of convergence of $F(x)$. In this paper, we consider the approximation of $F(1/b)$ by algebraic numbers. In particular, we prove that $F(1/b)$ cannot…
Meromorphic solutions of non-linear differential equations of the form $f^n+P(z,f)=h$ are investigated, where $n\geq 2$ is an integer, $h$ is a meromorphic function, and $P(z,f)$ is differential polynomial in $f$ and its derivatives with…
The third del Pezzo surface admits a unique Kaehler-Einstein metric, which is not known in closed form. The manifold's toric structure reduces the Einstein equation to a single Monge-Ampere equation in two real dimensions. We numerically…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in…
This thesis is about the study of Diophantine equations involving binary recurrent sequences with arithmetic functions. Various Diophantine problems are investigated and new results are found out of this study. Firstly, we study several…