We introduce the notions of alternating roots of polynomials and alternatingpolynomials over a Cayley-Dickson algebra, and prove a connection between thealternating roots of a given polynomial and the roots of the correspondingalternating polynomial over the Cayley-Dickson doubling of the algebra. We alsoinclude a detailed Octave code for the computation of alternating roots overHamilton's quaternions
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...
We introduce a blossoming procedure for polynomials related to the Askey–Wilson operator. This new b...
We study localization properties and the prime spectrum of the integer-valued polynomial ring (Formu...
We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayl...
The Cayley-Dickson loop Qn is the multiplicative closure of basic elements of the algebra constructe...
We study the roots of polynomials over Cayley--Dickson algebras over an arbitrary field and of arbit...
AbstractThe presentation of alternating permutatioas via labelled binary trees is used to define pol...
Cayley-Dickson construction produces a sequence of normed algebras over real numbers. Its consequent...
Abstract. Given a finite group G, a set of basis vectors B = {ip|p ∈ G} and a ‘sign function ’ or ‘t...
For Elaine Yaw in honor of friendship Abstract. The imaginary unit i of C, the complex numbers, squa...
3In this paper we briefly present the fundamental theorem of algebra for polynomials with coefficien...
The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dick...
3Abstract. In this paper we prove the fundamental theorem of algebra for polynomials with coefficien...
We calculate the eigenvalue \rho of the multiplication mapping R on the Cayley-Dickson algebra A_n. ...
AbstractThis paper considers structured matrix methods for the calculation of the theoretically exac...
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...
We introduce a blossoming procedure for polynomials related to the Askey–Wilson operator. This new b...
We study localization properties and the prime spectrum of the integer-valued polynomial ring (Formu...
We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayl...
The Cayley-Dickson loop Qn is the multiplicative closure of basic elements of the algebra constructe...
We study the roots of polynomials over Cayley--Dickson algebras over an arbitrary field and of arbit...
AbstractThe presentation of alternating permutatioas via labelled binary trees is used to define pol...
Cayley-Dickson construction produces a sequence of normed algebras over real numbers. Its consequent...
Abstract. Given a finite group G, a set of basis vectors B = {ip|p ∈ G} and a ‘sign function ’ or ‘t...
For Elaine Yaw in honor of friendship Abstract. The imaginary unit i of C, the complex numbers, squa...
3In this paper we briefly present the fundamental theorem of algebra for polynomials with coefficien...
The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dick...
3Abstract. In this paper we prove the fundamental theorem of algebra for polynomials with coefficien...
We calculate the eigenvalue \rho of the multiplication mapping R on the Cayley-Dickson algebra A_n. ...
AbstractThis paper considers structured matrix methods for the calculation of the theoretically exac...
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...
We introduce a blossoming procedure for polynomials related to the Askey–Wilson operator. This new b...
We study localization properties and the prime spectrum of the integer-valued polynomial ring (Formu...