Related papers: The Cayley-Dickson process for dialgebras
We work to find a basis of graded identities for the octonion algebra. We do so for the $\mathbb{Z}_2^2$ and $\mathbb{Z}_2^3$ gradings, both of them derived of the Cayley-Dickson process, the later grading being possible only when the…
Finding identities in nonassociative algebras plays an important role in the study of properties of these algebras. In this paper, we present some identities in alternative algebras and in algebras obtained by the Cayley-Dickson process.…
This paper is a short survey about some properties of algebras ob- tained by the Cayley-Dickson process and some of their applications.
This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras,…
In this paper we improve the level and sublevel of algebras obtained by the Cayley-Dickson process when their level and sublevel are greater than dimension of the algebras.
For every variety of algebras over a field, there is a natural definition of a corresponding variety of dialgebras (Loday-type algebras). In particular, Lie dialgebras are equivalent to Leibniz algebras. We use an approach based on the…
We present here some results of applying the Cayley-Dickson process to certain alternative algebras (notably built upon Galois fields and congruence rings), in a manner which might yield new building blocks for cryptographic systems. We…
We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayley-Dickson algebra, and prove a connection between the alternating roots of a given polynomial and the roots of the corresponding…
We define Leibniz triple systems in a functorial manner using the algorithm of Kolesnikov and Pozhidaev which converts identities for algebras into identities for dialgebras. We verify that Leibniz triple systems are the natural analogues…
In this paper we will prove that the Hall identity is true in all algebras obtained by the Cayley-Dickson process and, in some conditions, the converse is also true.
In this paper, we give some properties of the levels and sublevels of algebras obtained by the Cayley-Dickson process. We will emphasize how isotropy of some quadratic forms can influence the levels and sublevels of algebras obtained by the…
New families of eight-dimensional real division algebras with large derivation algebra are presented: We generalize the classical Cayley-Dickson doubling process starting with a unital algebra with involution over a field F by allowing the…
In this paper, we define a special class of elements in the algebras obtained by the Cayley Dickson process, called l elements. We find conditions such that these elements to be invertible. These conditions can be very useful for finding…
We present the most general polynomial Lie algebra generated by a second order integral of motion and one of order M, construct the Casimir operator, and show how the Jacobi identity provides the existence of a realization in terms of…
The Cayley-Dickson loop Q_n is the multiplicative closure of basic elements of the algebra constructed by n applications of the Cayley-Dickson doubling process (the first few examples of such algebras are real numbers, complex numbers,…
The associative Cayley-Dickson algebras over the field of real numbers are also Clifford algebras. The alternative but nonassociative real Cayley-Dickson algebras, notably the octonions and split octonions, share with Clifford algebras an…
We apply Kolesnikov's algorithm to obtain a variety of nonassociative algebras defined by right anticommutativity and a `noncommutative' version of the Malcev identity. We use computational linear algebra to verify that these identities are…
Starting from some ideas given by Bales in [Ba; 09], in this paper we present an algorithm for computing the elements of the basis in an algebra obtained by the Cayley-Dickson process. As a consequence of this result, we prove that an…
We take an algorithmic and computational approach to a basic problem in abstract algebra: determining the correct generalization to dialgebras of a given variety of nonassociative algebras. We give a simplified statement of the KP algorithm…
We define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…