Computational techniques for proving identities in symmetric compositions

Details Computational techniques for proving identities in symmetric compositions Computational techniques for proving identities in symmetric compositions

2007-06-07

arxiv.org/abs/0706.1097v1

Mathematics

Rings and Algebras

19 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computational techniques for proving identities in symmetric compositions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational techniques for proving identities in symmetric compositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational techniques for proving identities in symmetric compositions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652244