> This way the basic simplification is also trivial, so what remains is > the question of more sophisticated simplifications using some > identities, but I guess that's the same problem as with ratsimp, > expand, combine, factor etc. One just need to write a special method > with a special algorithm.
As a proof of concept, I implemented a Pauli algebra: http://sympy.googlecode.com/svn/trunk/sympy/modules/paulialgebra.py where the only identity, which is recursively used is: return delta(j,k) \ +I*epsilon(j,k,1)*Pauli(1) \ +I*epsilon(j,k,2)*Pauli(2) \ +I*epsilon(j,k,3)*Pauli(3) Ondrej --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
