Related papers: Diophantine equations with three monomials
We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…
For ordinary differential equations in the complex domain, a central problem is to understand, in a given equation or class of equations, those whose solutions do not present multivaluedness. We consider autonomous, first-order, quadratic…
We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…
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…
We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…
In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
In this paper, we use some extension of the Cayley-Hamilton theorem to find a family of matrices with integer entries that satisfy the non-linear Diophantine equation $ x^{n}+y^{p}=z^{q}$ where $n,p$ and $q$ are arbitrary positive integers.
We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…
The main result of the present paper is the construction of fundamental solutions for a class of multidimensional elliptic equations with three singular coefficients, which could be expressed in terms of a confluent hypergeometric function…
The main objective of this paper is to introduce an algorithm for solving fractional and classical differential equations based on a new generalized fractional power series. The algorithm relies on expanding the solution of an FDE or an ODE…
In this paper we find non-negative integer solutions for exponential Diophantine equations of the type $p \cdot 3^x+ p^y=z^2,$ where $p$ is a prime number. We prove that such equation has a unique solution…
We present new family of exact analytic solutions for three anyons in a harmonic potential (or in free space) in terms of generalized harmonics on $S^3$, which supplement the known solutions. The new solutions satisfy the hard-core…
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…
We obtain two parametric solutions of the diophantine equation $\phi(x_1, x_2, x_3)=\phi(y_1, y_2, y_3)$ where $\phi(x_1, x_2, x_3)$ is the octic form defined by $\phi(x_1, x_2, x_3)=x_1^8+ x_2^8 + x_3^8 - 2x_1^4x_2^4 - 2x_1^4x_3^4 -…
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…
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and…