On Wed, Feb 23, 2011 at 12:24:25PM -0800, Alexandre Blondin Massé wrote:
> > Something which is quite related is how species / lazy power series
> > can be defined by implicit equations in Sage:
> >
> > sage: L = LazyPowerSeriesRing(QQ)
> > sage: one = L(1)
> > sage: monom = L.gen()
> > sage: s = L()
> > sage: s._name = 's'
> > sage: s.define(monom + s*s)
> >
> > sage: [s.coefficient(i) for i in range(7)]
> > [0, 1, 1, 2, 5, 14, 42]
> >
> > Unless there is a clear technical hurdle, I would vote for using
> > something in that style, rather than writing equations as strings and
> > using a separate parser.
>
> I'm not sure I follow you there with the lazy power series. Are you
> saying that what I intend to do is already present in Sage, but with
> different name?
No, just that this is another spot in Sage where mathematical objects
are defined using a set of (implicit) equations. What might be similar
too is that the defined objects are typically infinite, and computed
by lazy iterations.
That being said, species are typically used to define objects using a
(recursive) grammar. This can for example be used to implement
algebraic languages. I don't know how much this intersects your
situation, but this is sure worth a look. With the sage-combinat
patches applied, have a look at sage.combinat.demo?
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
