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 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 paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11), n = 2,3,…,10,11 by geometric method, with the related blocking sets and projective codes.
A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.
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).
A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.
A (k,n)-arc A in a finite projective plane PG(2,q) over Galois field GF(q), q=p⿠for same prime number p and some integer n≥2, is a set of k points, no n+1 of which are collinear. A (k,n)-arc is complete if it is not contained in a(k+1,n)-arc. In this paper, the maximum complete (k,n)-arcs, n=2,3 in PG(2,4) can be constructed from the equation of the conic.
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 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 More
(2)
β-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 More