I don't think you can have automated conversion like C(a^2 + b^2)
since it
makes sense to define:
sage: C = CombinatorialFreeModule(QQ, [ a^2, b^2, a*b, a^2+b^2 ])
sage: 2*C.basis()[a^2] + C.basis()[b^2]
B[b^2] + 2*B[a^2]
sage: 2*C.basis()[a^2] + C.basis()[b^2 + a^2]
2*B[a^2] + B[a^2 + b^2]
Then C(a^2 + b^2) would be ambiguous.
I gathered some of this from the examples and documentation, but
unfortunately it makes this not so useful for my purpose, which is
realizing a finite-dimensional quotient QQ[x1, ... ,xn]/I as a vector
space over QQ. One can do this by hand, but it gets old fast :( Can
one index by infinite sets with this code?
Nick
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
