Re: f # g



>Here is some code to do this using match operations.  Of course, this
>will be slower than hand-coding in Lisp, but unless you are doing this
>to extremely large expressions, or to lots of them, it probably
>doesn't matter.

Thanks very much for the code. I've tried it on some polynomials with
integer coefficients and it seems to work so far. I'll conduct more
tests. I do intend to work with large expressions. I don't know what
large and lots mean objectively, but I know that I tend to exceed the
capacity of Maxima and other packages. Right now, it is hanging in
the case of f # g for f,g polynomials in 5 variables, with f of degree
6 and g the square of a polynomial h of degree 15, where h has about
300 terms and f has about 15.

Apart from that, I think it will be good for me to learn to cross the
blood-brain barrier and program maxima stuff directly in Lisp for this
and other applications. How should I proceed?
-- 
Ignorantly,
Allan Adler 
* Disclaimer: I am a guest and *not* a member of the MIT CSAIL. My actions and
* comments do not reflect in any way on MIT. Also, I am nowhere near Boston.