Flint2-0.1.0.5: Haskell bindings for the flint library for number theory

Data.Number.Flint.Fmpz.Mod.MPoly.Factor

Synopsis

# Factorisation of multivariate polynomials over the integers mod n

Constructors

 FmpzModMPolyFactor !(ForeignPtr CFmpzModMPolyFactor)

Constructors

 CFmpzModMPolyFactor

#### Instances

Instances details
 Source # Instance details MethodspokeByteOff :: Ptr b -> Int -> CFmpzModMPolyFactor -> IO () #

Create a new FmpzModMPolyFactor

# Memory management

fmpz_mod_mpoly_factor_init f ctx

Initialise f.

fmpz_mod_mpoly_factor_clear f ctx

Clear f.

# Basic manipulation

fmpz_mod_mpoly_factor_swap f g ctx

Efficiently swap f and g.

fmpz_mod_mpoly_factor_length f ctx

Return the length of the product in f.

fmpz_mod_mpoly_factor_get_constant_fmpz c f ctx

Set c to the constant of f.

fmpz_mod_mpoly_factor_get_base B f i ctx

fmpz_mod_mpoly_factor_swap_base B f i ctx

Set (resp. swap) B to (resp. with) the base of the term of index i in f.

fmpz_mod_mpoly_factor_get_exp_si f i ctx

Return the exponent of the term of index i in f. It is assumed to fit an slong.

fmpz_mod_mpoly_factor_sort f ctx

Sort the product of f first by exponent and then by base.

# Factorisation

fmpz_mod_mpoly_factor_squarefree f A ctx

Set f to a factorization of A where the bases are primitive and pairwise relatively prime. If the product of all irreducible factors with a given exponent is desired, it is recommended to call fmpz_mod_mpoly_factor_sort and then multiply the bases with the desired exponent.

fmpz_mod_mpoly_factor f A ctx

Set f to a factorization of A where the bases are irreducible.