#19620: fast (lazy) infinite words
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Vincent Delecroix | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vdelecroix/19620 | 1e506ee2885dc086f24973db538dc4682ace1e01
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by mantepse):
Wow! this looks like a much better basis for power series, in particular
for species. A question: I'd like to do
{{{
sage: SymmetricFunctions(QQ).inject_shorthands()
sage: Word(lambda n: h[n])
word:
h[],h[1],h[2],h[3],h[4],h[5],h[6],h[7],h[8],h[9],h[10],h[11],h[12],h[13],h[14],h[15],h[16],h[17],h[18],h[19],h[20],h[21],h[22],h[23],h[24],h[25],h[26],h[27],h[28],h[29],h[30],h[31],h[32],h[33],h[34],h[35],h[36],h[37],h[38],h[39],...
}}}
and now apply a {{{lambda f: p(f)}}} to each "letter". Is this easy to
do?
--
Ticket URL: <http://trac.sagemath.org/ticket/19620#comment:10>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
