Copyright | (c) Felix Springer 2019 |
---|---|
License | BSD3 |
Maintainer | felixspringer149@gmail.com |
Stability | experimental |
Portability | POSIX |
Safe Haskell | Safe |
Language | Haskell2010 |
This module defines data structures that implement Dynkin Diagrams as a way to represent Lie Algebras.
Synopsis
- data Dynkin = Dynkin DynkinNode
- data DynkinNode = DynkinNode [DynkinVertex]
- data DynkinVertex
- reverse :: Dynkin -> Dynkin
- variations :: Dynkin -> [Dynkin]
Documentation
A type that represents a Dynkin Diagram
data DynkinNode Source #
Instances
Eq DynkinNode Source # | |
Defined in Lie.Dynkin (==) :: DynkinNode -> DynkinNode -> Bool # (/=) :: DynkinNode -> DynkinNode -> Bool # | |
Show DynkinNode Source # | |
Defined in Lie.Dynkin showsPrec :: Int -> DynkinNode -> ShowS # show :: DynkinNode -> String # showList :: [DynkinNode] -> ShowS # |
data DynkinVertex Source #
Instances
Eq DynkinVertex Source # | |
Defined in Lie.Dynkin (==) :: DynkinVertex -> DynkinVertex -> Bool # (/=) :: DynkinVertex -> DynkinVertex -> Bool # | |
Show DynkinVertex Source # | |
Defined in Lie.Dynkin showsPrec :: Int -> DynkinVertex -> ShowS # show :: DynkinVertex -> String # showList :: [DynkinVertex] -> ShowS # |
variations :: Dynkin -> [Dynkin] Source #
Return a list of all (simpler, ) equivalent Dynkin Diagrams.