singular-factory-0.1: Multivariate polynomial factorization via bindings to Singular-factory

Safe HaskellNone
LanguageHaskell2010

Math.Singular.Factory.Internal.CanonicalForm

Contents

Description

Low-level bindings to singular-factory

Synopsis

types

data CanonicalForm Source #

Instances
Num CF Source # 
Instance details

Defined in Math.Singular.Factory.Internal.Factory

Methods

(+) :: CF -> CF -> CF #

(-) :: CF -> CF -> CF #

(*) :: CF -> CF -> CF #

negate :: CF -> CF #

abs :: CF -> CF #

signum :: CF -> CF #

fromInteger :: Integer -> CF #

constants

versions

config

memory management

variables

factors

lists

factorization

basic CFs

basic CF predicates

basic properties

small values

Polynomial operations

getCfAtIndex :: CF -> Int -> IO CF Source #

Get the given degree part

mapIntoIO :: CF -> IO CF Source #

Map into the current base domain

substituteIO :: Var -> CF -> CF -> IO CF Source #

Map into the current base domain

Binary operations

plusIO :: CF -> CF -> IO CF Source #

minusIO :: CF -> CF -> IO CF Source #

timesIO :: CF -> CF -> IO CF Source #

powIO :: CF -> Int -> IO CF Source #

divIO :: CF -> CF -> IO CF Source #

modIO :: CF -> CF -> IO CF Source #

GMP compatibility layer

Base domain characteristic

setCharacteristic1 :: Int -> IO () Source #

prime fields and QQ

setCharacteristic3 :: Int -> Int -> Char -> IO () Source #

Galois fields

getGFValue :: CF -> IO Int Source #

This returns the exponent of the canonical generator. If the input is zero, it appears to return the order of the field, q, but don't rely on this...

isFFinGF_IO :: CF -> IO Bool Source #

True if element of the prime subfield

getGFDegree :: IO Int Source #

Returns the degree of the Galois field (degree of extension over the prime field)

getGFGenerator :: IO CF Source #

Returns the generator of the Galois field