#8762: the sparse=True flag is horribly broken for GF(p)[x]
------------------------+---------------------------------------------------
Reporter: was | Owner: AlexGhitza
Type: defect | Status: new
Priority: critical | Milestone: sage-5.0
Component: algebra | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
------------------------+---------------------------------------------------
{{{
On Apr 24, 2010, at 5:36 PM, Michael Rybalkin wrote:
How to get monomial with large exponent in the polynomial rings?
For example I hsave polynomial ring over large finite field:
p = next_prime(10^20)
R.<x> = PolynomialRing(GF(p), sparse=True)
Monomial x^(10^7) construction takes 2 seconds:
time tmp = x^(10^7)
Monomial x^(10^8) construction uses all 6 Gb server memory and cannot
finish.
And without 'sparse=True' option I cannot even get x^(10^6).
What is the limitations for monomial exponents in polynomial rings?
What can be done in my case? For example GAP handles this case without
any problem.
Seems like the sparse=True flag is horribly broken for GF(p)[x]:
sage: p = next_prime(10^20)
sage: R.<x> = PolynomialRing(GF(p), sparse=True)
sage: type(x)
<type 'sage.rings.polynomial.polynomial_zz_pex.Polynomial_ZZ_pEX'>
sage: R.<x> = PolynomialRing(QQ, sparse=True)
sage: x^(10^8)
x^100000000
- Robert Bradshaw
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8762>
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.
