#19999: infinite recursion creating certain asymptotic expansion
-----------------------------------------+------------------------
Reporter: dkrenn | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-7.1
Component: asymptotic expansions | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
-----------------------------------------+------------------------
Comment (by cheuberg):
(continued; trac timeout)
- Having `(-q)<= q^x` would be fine, but not in the context of a cartesian
product where the order would no longer be lexicographic (we'd need to
compare |q|, k, sign(q) lexicographically for terms `q^n n^k`)
- Forbidding negative bases in exponential growth groups. `(-q)^n` can be
modeled by `q^n alpha` where alpha is a root of `alpha^2-1`, so the
coefficient ring is `ZZ[alpha]/(alpha^2-1).` Inconvenient, but correct.
--
Ticket URL: <http://trac.sagemath.org/ticket/19999#comment:7>
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.
