#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-7.1
      Component:  combinatorics      |   Resolution:
       Keywords:  analytic           |    Merged in:
  combinatorics, multivariate        |    Reviewers:  Daniel Krenn, David
  generating functions, asymptotics  |  Loeffler, Travis Scrimshaw
        Authors:  Daniel Krenn,      |  Work issues:
  Alex Raichev                       |       Commit:
Report Upstream:  N/A                |  3182c5b134f527de94a3728e7394e7fc27014c3e
         Branch:                     |     Stopgaps:
  public/combinat/10519              |
   Dependencies:                     |
-------------------------------------+-------------------------------------

Comment (by dkrenn):

 Replying to [comment:134 tscrim]:
 Although I don't like the changes on ​85c1f37. Instead, I think you should
 just explicitly check that the dictionary of solutions is the correct one:
 > {{{
 > sage: s == [{SR(x): 1, SR(y): 1}]
 > True
 > }}}

 Reverted and changed; indeed much nicer.

--
Ticket URL: <http://trac.sagemath.org/ticket/10519#comment:136>
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.

Reply via email to