Related papers: Polynomial Equations over Octonion Algebras
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…
In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…
We study in detail the class of even polynomials and their behavior with respect to finite free convolutions. To this end, we use some specific hypergeometric polynomials and a variation of the rectangular finite free convolution to…
In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…
We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.
A time-dependent monic polynomial in the z variable with N distinct roots such that exactly one root has multiplicity m>=2 is considered. For k=1,2, the k-th derivatives of the N roots are expressed in terms of the derivatives of order j<=…
Hurwitz algebras are unital composition algebras widely known in algebra and mathematical physics for their useful applications. In this paper, inspired by works of Lesenby and Hitzer, we show how to embed all seven Hurwitz algebras…
The Hurwitz problem of composition of quadratic forms, or of "sum of squares identity" is tackled with the help of a particular class of $(\mathbb{Z}_2)^n$-graded non-associative algebras generalizing the octonions. This method provides an…
Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of…
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…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
We consider roots of a generalized Lens polynomial $L(z,\bar z)={\bar z}^m q(z)-p(z)$ and also harmonically splitting Lens type polynomial $L^{hs}(z,\bar z)=r(\bar z)q(z)-p(z)$ and with ${\rm deg}\,q(z)=n$, ${\rm deg}\,r(\bar z)=m$ and…
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
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'…