Opened 10 years ago
Closed 10 years ago
#1407 closed enhancement (fixed)
[with patch, with positive review] deciding that generators don't generate an order in some extensions can be way way too slow.
Reported by: | was | Owned by: | was |
---|---|---|---|
Priority: | major | Milestone: | sage-2.9 |
Component: | number theory | Keywords: | |
Cc: | Merged in: | ||
Authors: | Reviewers: | ||
Report Upstream: | Work issues: | ||
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description
Consider this:
sage: P.<a,b,c> = QQ[2^(1/2), 2^(1/3), 2^(1/5)] sage: P.order([1,a]) *should* go boom very quickly... but runs forever and runs out of RAM
In the situation above, a satisfies only a quadratic polynomial so there is no possible way it will generate an order in a degree 8 field, since the index [O_K : ZZ[a]] is clearly infinite. Sage should quickly detect this and give an error message, but doesn't for some reason.
Attachments (2)
Change History (5)
Changed 10 years ago by
comment:1 Changed 10 years ago by
- Summary changed from deciding that generators don't generate an order in some extensions can be way way too slow. to [with patch] deciding that generators don't generate an order in some extensions can be way way too slow.
Changed 10 years ago by
comment:2 Changed 10 years ago by
- Summary changed from [with patch] deciding that generators don't generate an order in some extensions can be way way too slow. to [with patch, with positive review] deciding that generators don't generate an order in some extensions can be way way too slow.
comment:3 Changed 10 years ago by
- Resolution set to fixed
- Status changed from new to closed
Merged in 2.9.rc0.
Note: See
TracTickets for help on using
tickets.
Minor doctest touchups.