Related papers: A new method of solving quartic and higher degree …
Two combined methods for computing solutions of time-varying semilinear differential-algebraic equations (descriptor systems) are obtained. When constructing the methods, time-varying spectral projectors which can be found numerically are…
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…
A general method for solving linear differential equations of arbitrary order, is used to arrive at new representations for the solutions of the known differential equations, both without and with a source term. A new quasi-solvable…
In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are…
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…
A comprehensive analysis of the morphology of the solution space for a special type of quadratic quaternion equation is presented. This equation, which arises in a surface construction problem, incorporates linear terms in a quaternion…
We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…
Recently, Peter Doyle and Curt McMullen devised an iterative solution to the fifth degree polynomial. At the method's core is a rational mapping of the Riemann sphere with the icosahedral symmetry of a general quintic. Moreover, this map…
Solving linear diophantine equations in two variables have applications in computer science and mathematics. In this paper, we revisit an algorithm for solving linear diophantine equations in two variables, which we refer as DEA-R…
Solving two-variable linear Diophantine equations has applications in many cryptographic protocols such as RSA and Elliptic curve cryptography. The Extended Euclid's algorithm is a well known algorithm to solve these equations. We revisit…
This paper collects polynomial Diophantine equations that are simple to state but apparently difficult to solve.
The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be…
We propose a collocation method based on multivariate polynomial splines over triangulation or tetrahedralization for the numerical solution of partial differential equations. We start with a detailed explanation of the method for the…
This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…
Differential equations with constant and variable coefficients over octonions are investigated. It is found that different types of differential equations over octonions can be resolved. For this purpose non-commutative line integration is…
In this paper, we obtain an asymptotic formula for the number of integral solutions to a system of diagonal equations. We obtain an asymptotic formula for the number of solutions with variables restricted to smooth numbers as well. We…
We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The…