Hi!
Looking around the code recently, it seems to me that currently there are
several ways to access/implement free algebras. One option is
sage: F = FreeAlgebra(ZZ,3,'x')
sage: F
Free Algebra on 3 generators (x0, x1, x2) over Integer Ring
On the other hand, there is an example in
sage: A = AlgebrasWithBasis(ZZ).example()
sage: A
An example of an algebra with basis: the free algebra on the generators ('a',
'b', 'c') over Integer Ring
Which should be used in the long run?
In the example it is much easier to have access to the support
sage: A.an_element()
B[word: ] + 2*B[word: a] + 3*B[word: b]
sage: A.an_element().support()
[word: , word: a, word: b]
Is it already possible or would it be easy to implement a quotient of the free
algebra
by specifying relations between the generators?
Best,
Anne
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sage-combinat-devel?hl=en.
