In this thesis, some sets of subspaces of projective plane PG(2,q) over Galois field GF(q) and the relations between them by some theorems and examples can be shown.
In this work, new kinds of blocking sets in a projective plane over Galois field PG(2,q) can be obtained. These kinds are called the complete blocking set and maximum blocking set. Some results can be obtained about them.
In this work, we construct complete (K, n)-arcs in the projective plane over Galois field GF (11), where 12 2 ≤ ≤ n ,by using geometrical method (using the union of some maximum(k,2)- Arcs , we found (12,2)-arc, (19,3)-arc , (29,4)-arc, (38,5)-arc , (47,6)-arc, (58,7)-arc, (68,6)-arc, (81,9)-arc, (96,10)-arc, (109,11)-arc, (133,12)-arc, all of them are complete arc in PG(2, 11) over GF(11).
In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.
The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs. All of these arcs are incomplete. The number of distinct (12,3)-arcs are six, two of them are complete. There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete. There exists one complete (15,3)-arc.
The purpose of this work is to construct complete (k,n)-arcs in the projective 2-space PG(2,q) over Galois field GF(11) by adding some points of index zero to complete (k,n–1)arcs 3  n  11. A (k,n)-arcs is a set of k points no n + 1 of which are collinear. A (k,n)-arcs is complete if it is not contained in a (k + 1,n)-arc
The aim of this paper is to construct the (k,r)-caps in the projective 3-space PG(3,p) over Galois field GF(4). We found that the maximum complete (k,2)-cap which is called an ovaloid , exists in PG(3,4) when k = 13. Moreover the maximum (k,3)-caps, (k,4)-caps and (k,5)-caps.
This research is concerned with the study of the projective plane over a finite field . The main purpose is finding partitions of the projective line PG( ) and the projective plane PG( ) , in addition to embedding PG(1, ) into PG( ) and PG( ) into PG( ). Clearly, the orbits of PG( ) are found, along with the cross-ratio for each orbit. As for PG( ), 13 partitions were found on PG( ) each partition being classified in terms of the degree of its arc, length, its own code, as well as its error correcting. The last main aim is to classify the group actions on PG( ).
(2)
The main purpose of this work is to find the complete arcs in the projective 3-space over Galois field GF(2), which is denoted by PG(3,2), by two methods and then we compare between the two methods
The purpose of this paper is to give the definition of projective 3-space PG(3,q) over Galois field GF(q), q = pm for some prime number p and some integer m.
Also, the definition of the plane in PG(3,q) is given and state the principle of duality.
Moreover some theorems in PG(3,q) are proved.
Our research is related to the projective line over the finite field, in this paper, the main purpose is to classify the sets of size K on the projective line PG (1,31), where K = 3,…,7 the number of inequivalent K-set with stabilizer group by using the GAP Program is computed.