Related papers: A Simple Trigonometric Classification of Quintic R…

Let $Q_{p,q}(t)\in\mathbb{Z}[t]$ be Sharipov's even monic degree-$10$ second cuboid polynomial depending on coprime integers $p\neq q>0$. Writing $Q_{p,q}(t)$ as a quintic in $t^{2}$ produces an associated monic quintic polynomial. After…

The solution of the cubic equation has a century-long history; however, the usual presentation is geared towards applications in algebra and is somewhat inconvenient to use in optimization where frequently the main interest lies in real…

This short article presents explicit expressions for roots of a quartic equation that has all four real roots. Although a general expression for quartic roots is available on Wikipedia, an optimized and slightly shorter expression for only…

The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…

In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…

In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…

For the general monic quintic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities together…

The isolation intervals of the real roots of the real symbolic monic cubic polynomial $p(x) = x^3 + a x^2 + b x + c\,\,$ are found in terms of simple functions of the coefficients of the polynomial (such as: $-a$, $-a/3$, $-c/b$, $\pm…

This article introduces an intuitive function MY that simplifies solving cubic equations without venturing into the complex space. To many, it's quite strange that cubic root(s) are expressed using trigonometric functions in the…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

We consider the even monic degree-$10$ second cuboid polynomial $Q_{p,q}(t)\in\mathbb{Z}[t]$ depending on coprime integers $p\neq q>0$. We exclude the existence of a splitting of type $5+5$ over $\mathbb{Q}$, i.e., a factorization of…

The requirement for solving a polynomial is a means of breaking its symmetry, which in the case of the quintic, is that of the symmetric group S_5. Induced by its five-dimensional linear permutation representation is a three-dimensional…

The conditions for cubic equations, to have 3 real roots and 2 of the roots lie in the closed interval $[-1, 1]$ are given. These conditions are visualized. This question arises in physics in e.g. the theory of tops.

For the general monic cubic and quartic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities…

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…