Group action on the projective space PG(3,q)  is a method which can be used to construct some geometric objects for example cap. We constructed new caps in PG(3,13)  of degrees 2, 3, 4, 7,14 and sizes 2, 4, 5, 7, 10, 14, 17, 20, 28, 34, 35, 68, 70, 85, 119, 140, 170, 238, 340, 476, 595, 1190. Then the incomplete caps are extended to complete caps. 

A non-zero module M is called hollow, if every proper submodule of M is small. In this work we introduce a generalization of this type of modules; we call it prime hollow modules. Some main properties of this kind of modules are investigated and the relation between these modules with hollow modules and some other modules are studied, such as semihollow, amply supplemented and lifting modules.

    The present study aims to convert obsidian rocks into spongy gravel for the use in the production of lightweight and heat insulating concrete. The rocks were burned at 960°C to achieve maximum swelling of the samples, then broken into gravel and sand sizes. For comparison purposes, two other types of aggregates were used, namely pumice and basalt. The main physical tests, such as specific gravity, bulk density, porosity, and water absorption were performed. For testing the resistance of samples to alkalinity, KOH and Na OH solutions were used. The results showed that the obsidian sample gave the best specifications, where its specific gravity was 0.33, while the values were 1.1 for pumice and 2.7 for basalt, with the

   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. 

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

     This paper aims to introduce the concepts of  -closed, -coclosed, and -extending modules as generalizations of the closed, coclossed, and extending modules,  respectively. We will prove some properties as when the image of the e*-closed submodule is also e*-closed and when the submodule of the e*-extending module is e*-extending. Under isomorphism, the e*-extending modules are closed. We will study the quotient of e*-closed and e*-extending, the direct sum of e*-closed, and the direct sum of e*-extending.

      Let A, and N  are a semiring ,and  a left A- semimodule, respectively. In this work we will discuss two cases: 

1. The direct summand of π-projective semi module is π-projective, while the direct sum of two π-projective semimodules in general is not π-projective . The details of the proof will be given.
2. We will give a condition under which the direct sum of two π-projective semi modules is π-projective, as well as we also set conditions under which π-projective semi modules are projective.

Let R be a commutative ring with unity 1 6= 0, and let M be a unitary left module over R. In this paper we introduce the notion of epiform∗ modules. Various properties of this class of modules are given and some relationships between these modules and other related modules are introduced.

            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

A cap of size  and degree  in a projective space, (briefly; (k,r)-cap) is a set of  points with the property that each line in the space meet it in at most  points. The aim of this research is to extend the size and degree of complete caps and incomplete caps, (k, r)-caps of degree r<12 in the finite projective space of dimension three over the finite field of order eleven, which already exist and founded by the action of subgroups of the general linear group over the finite field of order eleven and degree four, to (k+i,r+1) -complete caps. These caps have been classified by giving the t_i-distribution and -distribution. The Gap programming has been used to execute the designed algorit