HaskellForMaths-0.4.9: Combinatorics, group theory, commutative algebra, non-commutative algebra
Math.Projects.KnotTheory.Braid
Contents
type LPQ = LaurentMPoly Q Source #
data BraidGens Source #
Constructors
Defined in Math.Projects.KnotTheory.Braid
Methods
(==) :: BraidGens -> BraidGens -> Bool #
(/=) :: BraidGens -> BraidGens -> Bool #
compare :: BraidGens -> BraidGens -> Ordering #
(<) :: BraidGens -> BraidGens -> Bool #
(<=) :: BraidGens -> BraidGens -> Bool #
(>) :: BraidGens -> BraidGens -> Bool #
(>=) :: BraidGens -> BraidGens -> Bool #
max :: BraidGens -> BraidGens -> BraidGens #
min :: BraidGens -> BraidGens -> BraidGens #
showsPrec :: Int -> BraidGens -> ShowS #
show :: BraidGens -> String #
showList :: [BraidGens] -> ShowS #
inv :: NPoly LPQ BraidGens -> NPoly LPQ BraidGens Source #
s_ :: Int -> NPoly LPQ BraidGens Source #
s1 :: NPoly LPQ BraidGens Source #
s2 :: NPoly LPQ BraidGens Source #
s3 :: NPoly LPQ BraidGens Source #
s4 :: NPoly LPQ BraidGens Source #
writhe :: NPoly r BraidGens -> Int Source #
k3_1 :: NPoly LPQ BraidGens Source #
k4_1 :: NPoly LPQ BraidGens Source #
k5_1 :: NPoly LPQ BraidGens Source #
k7_1 :: NPoly LPQ BraidGens Source #
inv :: LPQ -> LPQ Source #