On certain identities in symmetric compositions
We give in this paper a computational approach to the verification
of identities in symmetric compositions. We also show how to use rules and
patterns in noncommutative and nonassociative algebras. It is also presented an
implementation for linearization of identities. All the advantages and benefits
of working with rules, patterns and functional programming at the same time
will be pointed out. We have also included, as a previous section, a practical
description of a package with all the necessary instructions for checking
identities in para-octonions and pseudo-octononions algebras. This is a natural
first step before working with general rings.
P. Alberca Bjerregaard < pgalberca@uma.es >
C. Martín González < candido@apncs.cie.uma.es >