Opened 15 years ago

Closed 15 years ago

#653 closed enhancement (fixed)

Need LLL-optimize from pari

Reported by: jvoight Owned by: was
Priority: major Milestone: sage-2.8.10
Component: number theory Keywords:
Cc: Merged in:
Authors: Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Status badges


It would be good to port polredabs() from pari--this runs LLL to find a "small" generator of a field.

From gp:

? ?polredabs polredabs(x,{flag=0}): a smallest generating polynomial of the number field for the T2 norm on the roots, with smallest index for the minimal T2 norm. flag is optional, whose binary digit mean 1: give the element whose characteristic polynomial is the given polynomial. 4: give all polynomials of minimal T2 norm (give only one of P(x) and P(-x)). 16: partial reduction.

(Of course, this is part of the larger project of bringing the number fields up to speed...)

Change History (4)

comment:1 Changed 15 years ago by was

Milestone: sage-2.9
Type: defectenhancement

comment:2 Changed 15 years ago by mabshoff

Milestone: sage-2.9sage-2.8.9

I believe this issue has been fixed, but there is also malb's new LLL wrapper code.



comment:3 Changed 15 years ago by mabshoff

Milestone: sage-2.8.9sage-2.8.10

comment:4 Changed 15 years ago by cwitty

Resolution: fixed
Status: newclosed

polredabs() is in.

Hopefully we don't have to re-implement every computer algebra algorithm that uses LLL, just because we have a fast LLL now. If so, that should be a separate ticket. :)

Note: See TracTickets for help on using tickets.