2000 character limit reached
Symbolic Computations in Higher Dimensional Clifford Algebras
Published 16 Jun 2012 in math-ph and math.MP | (1206.3683v1)
Abstract: We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions, periodicity theorems and matrix spinor representations over Clifford numbers. We show how to code the graded algebra isomorphisms and the main involutions, and we provide some benchmarks.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.