HaskellForMaths-0.4.8: Combinatorics, group theory, commutative algebra, non-commutative algebra

Safe HaskellNone
LanguageHaskell98

Math.Algebra.Field.Extension

Documentation

newtype UPoly a Source

Constructors

UP [a] 

Instances

Eq a => Eq (UPoly a) Source 
(Eq a, Num a) => Num (UPoly a) Source 
Ord a => Ord (UPoly a) Source 
(Eq a, Show a, Num a) => Show (UPoly a) Source 

showUP :: (Eq t, Num t, Show t) => [Char] -> [t] -> [Char] Source

toUPoly :: (Eq a, Num a) => [a] -> UPoly a Source

(<+>) :: (Eq a, Num a) => [a] -> [a] -> [a] Source

(<*>) :: (Eq t, Num t) => [t] -> [t] -> [t] Source

convert :: (Eq a, Num a) => UPoly Integer -> UPoly a Source

lt :: UPoly a -> a Source

monomial :: Num a => a -> Int -> UPoly a Source

quotRemUP :: (Eq k, Fractional k) => UPoly k -> UPoly k -> (UPoly k, UPoly k) Source

modUP :: (Eq k, Fractional k) => UPoly k -> UPoly k -> UPoly k Source

extendedEuclidUP :: (Eq k, Fractional k) => UPoly k -> UPoly k -> (UPoly k, UPoly k, UPoly k) Source

data ExtensionField k poly Source

Constructors

Ext (UPoly k) 

Instances

Eq k => Eq (ExtensionField k poly) Source 
(Eq k, Fractional k, PolynomialAsType k poly) => Fractional (ExtensionField k poly) Source 
(Eq k, Fractional k, PolynomialAsType k poly) => Num (ExtensionField k poly) Source 
Ord k => Ord (ExtensionField k poly) Source 
(Eq k, Show k, Num k) => Show (ExtensionField k poly) Source 
(FinSet fp, Eq fp, Num fp, PolynomialAsType fp poly) => FinSet (ExtensionField fp poly) Source 
(FiniteField k, PolynomialAsType k poly) => FiniteField (ExtensionField k poly) Source 

(/>) :: (Eq t, Fractional t) => t -> UPoly t -> UPoly t Source

embed :: (Eq k, Num k) => UPoly Integer -> ExtensionField k poly Source

polys :: (Eq a, Eq a1, Num a, Num a1) => a1 -> [a] -> [UPoly a] Source

f4 :: [F4] Source

f8 :: [F8] Source

f9 :: [F9] Source

degree :: Foldable t => t a -> Int Source

data Sqrt a Source

Constructors

Sqrt a