Hi Ralf, what I really want to do is automate the calculation of nested commutators of multivariate polynomials of noncommuting variables (quantum operators). To me it is unacceptable that several decades after the invention of CASes we are still doing it by hand. It is a waste of time!
I already have a bilinear function that takes two multivariate polynomials of noncommuting variables (XDPOLY) and recursively traverses both applying a function to pairs of monomials. The next step is to recursively apply commutator identities to arrive at commutators of single-variable monomials with exponent 1. These commutators in turn will be evaluated using the commutation relations of the Lie algebra to which the noncommuting variables belong. I want to use FriCAS operators in order to produce symbolic expressions at each step, so that I can generate LaTeX expressions and also verify that the program does what I want. Coming from Maxima I am used to writing symbolic expressions just like that, but I really like the type-oriented approach of Axiom and family. I think it is very educational because you get to interactively learn to use the categorical framework that makes Haskell and ML so attractive for writing correct and extensible software. Marduk -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
