Related papers: A Simple Trigonometric Classification of Quintic R…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
From a topological viewpoint, a rational curve in the real projective plane is generically a smoothly immersed circle and a finite collection of isolated points. We give an isotopy classification of generic rational quintics in…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
The generic monic polynomial of sixth degree features 6 a priori arbitrary coefficients. We show that if these 6 coefficients are appropriately defined in two different ways|in terms of 5 arbitrary parameters, then the 6 roots of the…
In this paper, we present a third-order iterative method based on Potra-Pt{\'a}k method to compute the approximate multiple roots of nonlinear equations. The method requires two evaluations of the function and one evaluation of its first…
Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
Analysing the cubic sectors of a real polynomial of degree n, a modification of the Newton Rule is Signs is proposed with which stricter upper bound on the number of real roots can be found. A new necessary condition for reality of the…
In this paper we show that Cardanos formula for the solution of cubic equations can be reduced to expressions involving only square roots if the real root is rational.
Omar Khayyam's studies on cubic equations inspired the 12th century Persian mathematician Sharaf al-Din Tusi to investigate the number of positive roots. According to the noted mathematical historian Rashed, Tusi analyzed the problem for…
Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\M$ the maximal ideal of $A$. The first main result of this paper is a…
An algorithm to extract the square root in radicals from a multivector (MV) in real Clifford algebras Cl(p,q) for n=p+q <=3 is presented. We show that in the algebras Cl(3,0), Cl(1,2) and Cl(0,3) there are up to four isolated roots in a…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…
We call a polynomial monogenic if a root $\theta$ has the property that $\mathbb{Z}[\theta]$ is the full ring of integers in $\mathbb{Q}(\theta)$. Consider the two families of trinomials $x^n + ax + b$ and $x^n + cx^{n-1} + d$. For any…
Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
This note presents the multivariate Hermite criterion: a practical and powerful algorithm for determining the number of distinct real and complex roots of a zero-dimensional system of polynomials in any finite number of variables. The final…
We study the number of real critical points of a cyclotomic polynomial $\Phi_{n}(x)$, that is, the real roots of $\Phi_{n}^{\prime}(x)$. As usual, one can, without losing generality, restrict $n$ to be the product of distinct odd primes,…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…