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.
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( ).
A -set in the projective line is a set of projectively distinct points. From the fundamental theorem over the projective line, all -sets are projectively equivalent. In this research, the inequivalent -sets in have been computed and each -set classified to its -sets where Also, the has been splitting into two distinct -sets, equivalent and inequivalent.
The goal of this paper is to construct an arcs of size five and six with stabilizer groups of type alternating group of degree five and degree six . Also construct an arc of degree five and size with its stabilizer group, and then study the effect of and on the points of projective plane. Also, find a pentastigm which has the points on a line. Partitions on projective plane of order sixteen into subplanes and arcs have been described.
The article describes a certain computation method of -arcs to construct the number of distinct -arcs in for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons
... Show MoreThe main aim of this paper is to introduce the relationship between the topic of coding theory and the projective plane of order three. The maximum value of size of code over finite field of order three and an incidence matrix with the parameters, (length of code), (minimum distance of code) and (error-correcting of code ) have been constructed. Some examples and theorems have been given.
The main aims of this research is to find the stabilizer groups of a cubic curves over a finite field of order , studying the properties of their groups and then constructing the arcs of degree which are embedding in a cubic curves of even size which are considering as the arcs of degree . Also drawing all these arcs.
β-Adrenergic blocking agents, mostly comprising of β-amino alcohols, are of pharmaceutical significance and have received major attention due to their utility in the management of cardiovascular disorders including hypertension, angina pectoris, cardiac arrhythmias and other disorders related to the sympathetic nervous system. Most compounds available for clinical use belong to the aryloxypropanolamine series, which is considered the second generation of β-blocking agents. The present study includes the synthesis of compounds with an N-substituted oxypropanolamine moiety attached to the 1, 3, 4-thiadiazole derivatives. According to this information, eight compounds were synthesized and characterized by IR spectra and elemental m
... Show MoreThis research aims to give a splitting structure of the projective line over the finite field of order twenty-seven that can be found depending on the factors of the line order. Also, the line was partitioned by orbits using the companion matrix. Finally, we showed the number of projectively inequivalent -arcs on the conic through the standard frame of the plane PG(1,27)
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.