Ok, thanks.


 exp(a)*b*exp(c) -> exp(a+c)*b

 for any expression b. This one is not easy to do automatically within
 GiNaC for various reasons, I think.


I don't understand, why this would be hard?  The product of 3 (or more) expressions is already represented as a sequence in the "mul" expression type, so couldn't ginac just find all subexpressions in the product of type exp, and then collect them?  I guess I don't know how these auto-simplify methods are implemented.

Anyway I will try the subs/wildcard method as you suggested, I didn't think of that.  Thanks again!

-Levi