✦ LIBER ✦

On roots of quaternion polynomials

✍ Scribed by N. Topuridze

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 195 KB
Volume: 160
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-009-9530-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Zeros of quaternion polynomials

✍ R. Serôdio; Lok-Shun Siu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 147 KB

It is well known that, over a division ring, every zero of a polynomial f(x) = (:rxl) •.. (x -xn) is congruent to Xr for some r. In this note, we show further that, over the quaternion field, there exists at least one quaternion qr congruent to each x~, and that, through this result, a constructive

The roots of a split quaternion

✍ M. Özdemir 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 406 KB

## a b s t r a c t In this work, we express De Moivre's formula for split quaternions and find roots of a split quaternion using this formula.

Biquaternion (Complexified Quaternion) R

Biquaternion (Complexified Quaternion) Roots of −1

✍ Stephen J. Sangwine 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 228 KB

Computing the zeros of quaternion polyno

Computing the zeros of quaternion polynomials

✍ R. Serôdio; E. Pereira; J. Vitória 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 560 KB

On the Roots of Chromatic Polynomials

✍ Jason I. Brown 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 158 KB

It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)Â(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a

On the roots of cauchy polynomials

✍ K.P. Hadeler; G. Meinardus 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 734 KB