Safe Haskell | None |
---|---|

Language | Haskell98 |

Constructions of the finite geometries AG(n,Fq) and PG(n,Fq), their points, lines and flats, together with the incidence graphs between points and lines.

## Synopsis

- ptsAG :: Int -> [a] -> [[a]]
- ptsPG :: Num a => Int -> [a] -> [[a]]
- pnf :: (Eq a, Fractional a) => [a] -> [a]
- ispnf :: (Eq a, Num a) => [a] -> Bool
- closureAG :: (Num a, Ord a, FinSet a) => [[a]] -> [[a]]
- lineAG :: (Ord a, FinSet a, Num a) => [[a]] -> [[a]]
- closurePG :: (Num a, Ord a, FinSet a) => [[a]] -> [[a]]
- linePG :: (Ord a, Num a, FinSet a) => [[a]] -> [[a]]
- qtorial :: (Integral a, Integral b) => b -> a -> a
- qnomial :: (Integral a, Integral b) => b -> b -> a -> a
- numFlatsPG :: (Integral a, Integral b) => b -> a -> b -> a
- numFlatsAG :: (Integral b, Integral a) => b -> a -> b -> a
- qtorials :: Integral b => b -> [b]
- qnomials :: Num a => a -> [[a]]
- data ZeroOneStar
- rrefs :: Int -> Int -> [[[ZeroOneStar]]]
- flatsPG :: (Eq a, Num a) => Int -> [a] -> Int -> [[[a]]]
- flatsAG :: (Eq a, Num a) => Int -> [a] -> Int -> [[[a]]]
- linesPG :: (Eq a, Num a) => Int -> [a] -> [[[a]]]
- linesAG :: (Eq a, Num a) => Int -> [a] -> [[[a]]]
- linesAG1 :: (Ord a, FinSet a, Num a) => Int -> [a] -> [[[a]]]
- linesAG2 :: (Num a, Ord a, FinSet a) => Int -> [a] -> [[[a]]]
- incidenceGraphPG :: (Num a, Ord a, FinSet a) => Int -> [a] -> Graph (Either [a] [[a]])
- incidenceGraphAG :: (Num a, Ord a, FinSet a) => Int -> [a] -> Graph (Either [a] [[a]])
- orderGL :: (Num a, Integral b) => b -> a -> a
- orderAff :: (Integral b, Num a) => b -> a -> a
- orderPGL :: (Integral a, Integral b) => b -> a -> a
- heawood :: Graph Integer

# Documentation

ptsAG :: Int -> [a] -> [[a]] Source #

ptsAG n fq returns the points of the affine geometry AG(n,Fq), where fq are the elements of Fq

ptsPG :: Num a => Int -> [a] -> [[a]] Source #

ptsPG n fq returns the points of the projective geometry PG(n,Fq), where fq are the elements of Fq

pnf :: (Eq a, Fractional a) => [a] -> [a] Source #

closureAG :: (Num a, Ord a, FinSet a) => [[a]] -> [[a]] Source #

Given a list of points in AG(n,Fq), return their closure, the smallest flat containing them

closurePG :: (Num a, Ord a, FinSet a) => [[a]] -> [[a]] Source #

Given a set of points in PG(n,Fq), return their closure, the smallest flat containing them

numFlatsPG :: (Integral a, Integral b) => b -> a -> b -> a Source #

numFlatsAG :: (Integral b, Integral a) => b -> a -> b -> a Source #

data ZeroOneStar Source #

## Instances

Eq ZeroOneStar Source # | |

Defined in Math.Combinatorics.FiniteGeometry (==) :: ZeroOneStar -> ZeroOneStar -> Bool # (/=) :: ZeroOneStar -> ZeroOneStar -> Bool # | |

Show ZeroOneStar Source # | |

Defined in Math.Combinatorics.FiniteGeometry showsPrec :: Int -> ZeroOneStar -> ShowS # show :: ZeroOneStar -> String # showList :: [ZeroOneStar] -> ShowS # |

flatsPG :: (Eq a, Num a) => Int -> [a] -> Int -> [[[a]]] Source #

`flatsPG n fq k`

returns the k-flats in PG(n,Fq), where fq are the elements of Fq.
The returned flats are represented as matrices in reduced row echelon form,
the rows of which are the points that generate the flat.
The full set of points in the flat can be recovered by calling `closurePG`

flatsAG :: (Eq a, Num a) => Int -> [a] -> Int -> [[[a]]] Source #

flatsAG n fq k returns the k-flats in AG(n,Fq), where fq are the elements of Fq.

incidenceGraphPG :: (Num a, Ord a, FinSet a) => Int -> [a] -> Graph (Either [a] [[a]]) Source #

Incidence graph of PG(n,fq), considered as an incidence structure between points and lines