#11505: ideals_of_bdd_norm misterious bug?
-----------------------------+----------------------------------------------
Reporter: mmasdeu | Owner: davidloeffler
Type: defect | Status: new
Priority: minor | Milestone: sage-4.7.1
Component: number fields | Keywords: ideallist, ideals of bounded
norm, memory
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Here is a code that I try to run in my laptop:
{{{
sage: R.<t>=QQ['x']
sage: F.<a>=NumberField(t^2-t-7)
sage: V=F.ideals_of_bdd_norm(150000)
sage: assert(len(V[14369])>0)
sage: I=F.ideal(V[14369][0])
sage: assert(I.norm()==14369)
}}}
The last assertion should not complain, because ideals_of_bdd_norm(N)
should return a dict of integral ideals of norm up to N, indexed by the
norm.
I have only observed this when I ask for very large norms (I would like to
go up to 10e6, and the above is the smallest example that I got). If I ask
for norms up to 15000 say, then it works as expected.
I suspect that it is a problem with the communication with pari, but I
don't know enough about it to tell. Also, I should say that this doesn't
happen in other (bigger) machines that I have tried, so it might be
architecture-related, or maybe memory dirtyness...
I am running this on Sage 4.7, on a Thinkpad X41t with an updated Arch
distribution, if that is of any help. Also I will be happy to do more
tests if asked, of course!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11505>
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.
