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

Math.Combinatorics.FiniteGeometry

Description

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

# 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 #

ispnf :: (Eq a, Num a) => [a] -> Bool 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

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

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

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

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

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

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

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

qtorials :: Integral b => b -> [b] Source #

qnomials :: Num a => a -> [[a]] Source #

Constructors

 Zero One Star
Instances
 Source # Instance detailsDefined in Math.Combinatorics.FiniteGeometry Methods Source # Instance detailsDefined in Math.Combinatorics.FiniteGeometry MethodsshowList :: [ZeroOneStar] -> ShowS #

rrefs :: Int -> Int -> [[[ZeroOneStar]]] Source #

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.

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

The lines (1-flats) in PG(n,fq)

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

The lines (1-flats) in AG(n,fq)

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

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

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

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

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

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

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

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