In this paper, the packing problem for complete ( 4)-arcs in is partially solved. The minimum and the maximum sizes of complete ( 4)-arcs in are obtained. The idea that has been used to do this classification is based on using the algorithm introduced in Section 3 in this paper. Also, this paper establishes the connection between the projective geometry in terms of a complete ( , 4)-arc in and the algebraic characteristics of a plane quartic curve over the field represented by the number of its rational points and inflexion points. In addition, some sizes of complete ( 6)-arcs in the projective plane of order thirteen are established, namely for = 53, 54, 55, 56.
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 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.
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).
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 MoreIn this work, we construct projectively distinct (k,3)-arcs in the projective plane PG(2,9) by applying a geometrical method. The cubic curves have been been constructed by using the general equation of the cubic. We found that there are complete (13,3)-arcs, complete (15,3)-arcs and we found that the only (16,3)-arcs lead to maximum completeness
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
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.
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.
Number theorists believe that primes play a central role in Number theory and that solving problems related to primes could lead to the resolution of many other unsolved conjectures, including the prime k-tuples conjecture. This paper aims to demonstrate the existence of this conjecture for admissible k-tuples in a positive proportion. The authors achieved this by refining the methods of “Goldston, Pintz and Yildirim” and “James Maynard” for studying bounded gaps between primes and prime k-tuples. These refinements enabled to overcome the previous limitations and restrictions and to show that for a positive proportion of admissible k-tuples, there is the existence of the prime k-tuples conjecture holding for each “k”. The sig
... Show More