Okay, thanks. I'll give it a try. --Mike
On 4/29/07, Robert Bradshaw <[EMAIL PROTECTED]> wrote: > > I think its mostly there for convenience. Try passing in the empty > list and then overriding gens() and ngens() for starters. Perhaps > look into the source to see what it actually ends up doing with them... > > On Apr 29, 2007, at 12:15 AM, Mike Hansen wrote: > > > Hello, > > > > I'm trying to implement symmetric functions in SAGE and would like to > > define them as an algebra that fits into SAGE's framework and plays > > nicely with the rest of SAGE. But, it seems that Ring and Algebra are > > subclasses of ParentWithGens which requires a (finite) list of > > generators. What do you do when you want to implement an algebra with > > an infinite number of generators? > > > > Somewhat related, what do you do when the generators for your algebra > > are combinatorial objects so that it really doesn't make sense to > > translate them to an alphanumeric value? > > > > --Mike > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
