Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Stop using strings in #3

ketch opened this issue Aug 29, 2012 · 2 comments


Copy link

commented Aug 29, 2012

We need a symbolic algebra system that can handle two multiplication operations. One possibility is to use Sympy's TensorProduct.


This comment has been minimized.

Copy link

commented Oct 3, 2019

A possibility to represent rooted trees that I like is using level sequences as described in the paper Constant Time Generation of Rooted Trees. I've used this form for the Julia package RootedTrees.jl and am quite satisfied with it.


This comment has been minimized.

Copy link
Owner Author

commented Oct 8, 2019

That is a more computer-oriented representation of trees, and I would use it if I were implementing this from scratch now.

But this issue is actually intended to refer to something entirely different, which is the use of strings to represent the product on trees, in order to generate order conditions. See for instance lamda_str(). The reason for using strings there was just the need to represent a non-commutative product.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
None yet
2 participants
You can’t perform that action at this time.