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

        The aim of this paper is to introduce the definition of projective 3-space over Galois field GF(q), q = p^m, for some prime number p and some integer m.

        Also the definitions of (k,n)-arcs, complete arcs, n-secants, the index of the point and the projectively equivalent arcs are given.

        Moreover some theorems about these notations are proved.

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 paper is  to find an arc of degree five in 31 ,29),(2, =qqPG , with stabilizer group of type dihedral group of degree five 5 D and arcs of degree six and ten with stabilizer groups of type alternating group of degree five 5 A ,  then study the effect of  5 D and 5A on the points of projective plane. Also, find a pentastigm which has collinear diagonal points.

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.

The simulation of passively Q-switching is four non – linear first order differential equations. The optimization of passively Q-switching simulation was carried out using the constrained Rosenbrock technique. The maximization option in this technique was utilized to the fourth equation as an objective function; the parameters, γa, γc and β as were dealt with as decision variables. A FORTRAN program was written to determine the optimum values of the decision variables through the simulation of the four coupled equations, for ruby laser Q–switched by Dy +2: CaF2.For different Dy +2:CaF2 molecules number, the values of decision variables was predicted using our written program. The relaxation time of Dy +2: CaF2, used with ruby was

In this paper, we introduce the notions of Complete Pseudo Ideal, K-pseudo Ideal, Complete K-pseudo Ideal in pseudo Q-algebra. Also, we give some theorems and relationships among them are debated.