I'ce been playing with it but I don't understand the structure of your tree if you remember how the trees work that would be a big help because I have not been able to make heads or tails out of the out put of pf2tree() if you could explain what the 2 numbers preceding each token mean it would be greatly appreciated. Because not understanding that has been my biggest problem and has caused me to think about rewriting the whole simplifier from scratch something I was not looking foward to. I do realize that you may not remember though cause this Library is huge and I don't think i have even lookedat half of it yet.

I thank you for your help and support in my endeavors in optimizing this library.  This is nothing against your code or your talent but I think I'm going to replace your entire algebraic simplification with one of my own design. This is not because I think your design is poor it is just that I have my own simplifier halfway finished from before I started work on your library so I think that it will be easier for me to finish my simplifier then it will be for me to optimize yours because I understand mine better. additionally I don't want all the time I spent designing my CAS structure to go to waste although I do think I will be using your postfix notation generator because it make building my rather complicated structure far easier.

In other news what does libexpr\collect() do? And how often do you factor numbers outside of the algebraic simplifier because I was wondering if it would be worth my time to replace my\factorsmatrix() with my own version that I don't currently have typed up but is faster and deals with fractions by expressing the denominator as primes to negative exponents but is about twice the size (needed it for my own polynomial tools and wrote it totally independently of ti