Related papers: A systematic approach to Diophantine equations: op…
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 study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.
We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…
This article introduces a pedagogical method for {\it solving combinatorial problems} that frequently involve structures that are unfamiliar or less familiar. Indeed, an indirect method has been proposed in order to evade any possible…
We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…
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…
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…
The main difficulty in solving the discrete constrained problem is its poor and even ill condition. In this paper, we transform the discrete constrained problems on de Rham complex to Laplace-like problems. This transformation not only make…
A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…
We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
The generalized Lebesgue-Ramanujan-Nagell equation is an important type of polynomial-exponential Diophantine equation in number theory. In this survey, the recent results and some unsolved problems of this equation are given.
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
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 shall study existence of weak solutions to complex Hessian equations. With appropriate assumptions, it is possible to obtain weak solutions in pluripotential sense.
We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…
The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…
By following the same construction pattern which Martin Davis proposed in a 1968 paper of his, we have obtained six quaternary quartic Diophantine equations that candidate as `rule-them-all' equations: proving that one of them has only a…
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…