paper

The Cayley-Dickson process for dialgebras

arXiv:1209.2645

Abstract

We adapt the algorithm of Kolesnikov and Pozhidaev, which converts a polynomial identity for algebras into the corresponding identities for dialgebras, to the Cayley-Dickson doubling process. We obtain a generalization of this process to the setting of dialgebras, establish some of its basic properties, and construct dialgebra analogues of the quaternions and octonions.

18 pages

Cited by in corpus (1)

The Cayley-Dickson process for dialgebras · wovepaper