#14832: Unified construction of irreducible polynomials over finite fields
----------------------------+-----------------------------------------------
Reporter: pbruin | Owner: cpernet
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.12
Component: finite rings | Keywords: polynomials
Work issues: | Report Upstream: N/A
Reviewers: | Authors: Peter Bruin
Merged in: | Dependencies: #14817
Stopgaps: |
----------------------------+-----------------------------------------------
Currently, every finite field implementation (integers mod ''p'', Givaro,
NTL, PARI) has its own code for constructing an irreducible polynomial
when given a string as the `modulus` keyword. Here is a patch that
creates methods
`PolynomialRing_dense_{finite_field,mod_p}.irreducible_element(n,
algorithm=None)`. In a separate ticket, the `FiniteField` constructor
will be adapted to call this function.
Since it uses PARI's `ffinit`, this depends on #14817.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14832>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
