- Provide (prototype) documentation in the following formats: REPL using @doc, html, as well as pdf
- Copyright information (BSD 2-clause) in each file
- Build a (user)sysimage to speed up starting time
- implement Montes--Nart algorithm
- composite Dedekind criterion
- composite Round Two algorithm
- implement information about containment (O_1 \sub O_2)
- save prime factors of discriminant
-
princ_gen
should be cached - Clean up uniformizer (p-uniformizer? strong uniformizer?)
- Residue fields of degree one
- Parent checks for
(::Order)(::NumFieldElem)
. - Coercion of nf_elem in NfOrd
- Overhaul the morphisms
- Test functionality for non-monic defining polynomials
- Torsion unit functionality for number fields
- Better algorithm for normal closure
- weak and strong approximation
-
absolute_field
is inconsistent and needs keyword forsimplify
- Remove the type
nf_elem_or_fac_elem
- Clean up the clever
princ_gen_special
code - Implement Arakelov and/or divisor type
- Finite places
- Need
ismaximal_order_known
andisautomorphism_group_known
-
relative_extension
-
is_locally_power
(at given primes or up to given bound) - Frobenius automorphism of a field at a prime ideal
- Redo the
automorphism_group
properly. -
coeff(z, i)
andcoefficients(z)
"inconsistencies"
-
DiagonalGroup
andAbelianGroup
toabelian_group
. -
princ_gen
toprincipal_generator
-
nf
tonumber_field
- Group algebra renaming
- Make
has*
and*_known
consistent.
-
exp_map_unit_grp_mod
-
charpoly
should haveparent =
keyword. - Squarefree factorization over number fields (?)
- Make FF robust for the use of
fmpz
. -
next_prime(::fmpz, ::Bool)
-
round(::Type{fmpq}, ::fmpz)
is doing funky things. Also needs theRoundUp/RoundDown
versions. - Parent checks for factored elements
- Primitive element for all finite fields