#10519: analytic combinatorics: new code for computing asymptotics for
multivariate
generating functions
-----------------------------+----------------------------------------------
Reporter: araichev | Owner: sage-combinat
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.6.2
Component: combinatorics | Keywords: analytic combinatorics,
multivariate generating functions, asymptotics
Author: Alex Raichev | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by araichev):
Hi Sebastien:
Thanks very much for your helpful comments. I've been working on
rewriting my code in an object-oriented way and will incorporate your
suggestions. Some functions in mgf.sage, such as deciding whether a list
of polynomials is algebraically dependent, are general purpose, and so i'm
trying to put them into existing Sage classes. The others are more
specific to asymptotics and deserve their own class similar to the one you
outlined above. Robustness is also something i need to improve upon.
I'll post my modifications here after i write and test them more.
Thanks again.
Alex
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10519#comment:6>
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 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-trac?hl=en.
