Computational techniques for proving identities in symmetric compositions
| dc.creator | Bjerregaard, Pablo Alberca | |
| dc.creator | Gonzalez, Candido Martin | |
| dc.date | 2007-06-07 | |
| dc.date.accessioned | 2026-07-07T08:04:36Z | |
| dc.date.available | 2026-07-07T08:04:36Z | |
| dc.description | We present in this work a complete session in a Mathematica notebook. The aim of this notebook is to check identities in symmetric compositions. This notebook is a complement of our work [1] and it has all the explicit computations. We refer the reader to that paper which can be seen in http://www.uibk.ac.at/mathematik/loos/jordan/index.html. First of all we will present a few number of comands in order to simplify identities by extracting scalars, SOut. The rest of the strategy holds on the powerfull of using patterns and rules. | |
| dc.description | 19 pages | |
| dc.identifier | https://arxiv.org/abs/0706.1097 | |
| dc.identifier | http://arxiv.org/abs/0706.1097 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130022 | |
| dc.subject | Rings and Algebras | |
| dc.subject | 68-04 | |
| dc.title | Computational techniques for proving identities in symmetric compositions | |
| dc.type | text |