Related papers: Vieta's Formulas for Quaternionic Polynomials

We present a necessary and sufficient condition for a cubic polynomial to be positive for all positive reals. We identify the set where the cubic polynomial is nonnegative but not all positive for all positive reals, and explicitly give the…

The well-known Heun equation has the form: Q(z)S''(z)+P(z)S'(z)+V(z)S(z)=0 where Q(z) is a cubic complex polynomial, P(z) and V(z) are polynomials of degrees at most 2 and 1 resp. One of the classical problems about the Heun equation is for…

We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero…

This article discusses the classical problem of how to calculate $r_n(m)$, the number of ways to represent an integer $m$ by a sum of $n$ squares from a computational efficiency viewpoint. Although this problem has been studied in great…

We give abstract versions of the large deviation theorem for the distribution of zeros of polynomials and apply them to the characteristic polynomials of Hermitian random matrices. We obtain new estimates related to the local semi-circular…

We present an explicit algorithmic method for computing square roots in quaternion algebras over global fields of characteristic different from 2.

We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.

A method for finding relations for the roots of polynomials is presented. Our approach allows us to get a number of relations for the zeros of the classical polynomials and for the roots of special polynomials associated with rational…

In this note, we obtain asymptotic expected number of real zeros for random polynomials of the form $$f_n(z)=\sum_{j=0}^na^n_jc^n_jz^j$$ where $a^n_j$ are independent and identically distributed real random variables with bounded…

Suppose that $a_1(n),a_2(n),...,a_s(n),m(n)$ are integer-valued polynomials in $n$ with positive leading coefficients. This paper presents Popoviciu type formulas for the generalized restricted partition function…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

Using the section method we characterize the solutions $ f:U\rightarrow Y$ of the following four equations \begin{equation*} \sum\limits_{i=0}^{n}\left( -1\right) ^{n-i}\tbinom{n}{i}f\left( \sqrt[m]{ u^{m}+iv^{m}}\right) =\left( n!\right)…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

In this paper we derive generalizations of different properties of monic polynomial families of binomial type, i.e. families of monic polynomials, for which the binomial theorem holds $$ p_n(\alpha+\beta)=\sum_{k=0}^n…

Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…

In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…

The one-dimensional Schroedinger's equation is analysed with regard to the existence of exact solutions for decatic polynomial potentials. Under certain conditions on the potential's parameters, we show that the decatic polynomial potential…