Related papers: A Simple Trigonometric Classification of Quartic R…

We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…

Differential calculus is not a unique way to observe polynomial equations such as $a+b=c$. We propose a way of applying difference calculus to estimate multiplicities of the roots of the polynomials $a$, $b$ and $c$ satisfying the equation…

We present a scheme for finding all roots of an analytic function in a square domain in the complex plane. The scheme can be viewed as a generalization of the classical approach to finding roots of a function on the real line, by first…

This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present…

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…

We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

A linear quaternionic equation in one quaternionic variable q is of the form $a_1 q b_1+a_2 q b_2+ ... +a_m q b_m = c$, where the $a_i, b_j, c$ are given quaternionic coefficients. If introducing basis elements $\bf i, j, k$ of pure…

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…

In our notice we propose the classification of some quartic equations with only trivial solutions by the auxiliary equations. For proving trivial solutions of the quartic equations we use method infinite descent based on the number of prime…

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 study the number of real roots of random trigonometric polynomials with iid coefficients. When the coefficients have zero mean, unit variance and some finite high moments, we show that the variance of the number of real…

We present three new, practical algorithms for polynomials in $\mathbb{Z}[x]$: one to test if a polynomial is cyclotomic, one to determine which cyclotomic polynomials are factors, and one to determine whether the given polynomial is…

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

Consider a quartic number field $K$ generated by a root of an irreducible quadrinomial of the form $ F(x)= x^4+ax^3+bx+c \in \Z[x]$. Let $i(K)$ denote the index of $K$. Engstrom \cite{Engstrom} established that $i(K)=2^u \cdot 3^v$ with $u…