On Thu, Nov 26, 2009 at 05:09:13PM +0100, Florent hivert wrote:
> > On Thu, Nov 26, 2009 at 06:54:43AM -0800, Nathann Cohen wrote:
> > > Actually, I use these polynomials to emulate what your
> > > CombinatorialFreeModule does on a much larger basis : everything that
> > > is hashable ;-)
> > >
> > > I want to be able to index my variables with sets, with edges, with
> > > nodes, with almost anything we can come up with in Sage...
> >
> > sage: F = CombinatorialFreeModule(QQ, Objects())
> > sage: x = F.basis()
> > sage: x[1] + x[2.5] + x[Partition([3,2,1])] + x [ QQ ] + x[gap] +
> > x[x[3]+x[2]]
> > B[2.50000000000000] + B[1] + B[B[2] + B[3]] + B[Gap] + B[[3, 2, 1]] +
> > B[Rational Field]
> >
> > Good enough? :-)
>
> Nice :-) ?
>
> Now I see the point to not requiring that the basis of a
> CombinatorialFreeModule is an EnumeratedSets...
Yeah, enumerating Objects() might be an issue :-)
Although, technically, there are only a countable number of objects
that one can construct in Sage!
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--
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
