396 ยฉ Published by College of Education for Pure Science (Ibn Al-Haitham), University of Baghdad. This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License Extension of Size and Degree of (๐’Œ, ๐’“)-Caps in ๐‘ท๐‘ฎ(๐Ÿ‘, ๐Ÿ๐Ÿ‘) Saja Makki Attook1 and Emad Bakr Al-Zangana2* 1,2Department of Mathematics, College of Science, Mustansiriyah University, Baghdad, Iraq. *Corresponding Author. Received:3 February 2023 Accepted:30 March 2023 Published:20 July 2024 doi.org/10.30526/37.3.3268 Abstract The aim of this work is an extension of the (๐‘˜, ๐‘Ÿ)-caps (๐‘˜ is the order, ๐‘Ÿ is the degree), where 0 < ๐‘Ÿ < 14, in the three projective space of dimension over the Galois field of order thirteen, ๐‘ƒ๐บ(3,13). The extensions have been done on the caps founded by action subgroups of projective general linear of order four over the finite field of order thirteen on ๐‘ƒ๐บ(3,13). The main condition for the completion of the expansion process on the degree of caps is 14 (number of points on the line in ๐‘ƒ๐บ(3,13)) and the size of the cap is points with a zero index zero, as it becomes complete when it is equal to zero. In this paper, we present fifteen caps (completes and incompletes) in ๐‘ƒ๐บ(3,13) of degrees 2,3,4,7 are extended in size until they reach 14, which are then complete caps, and then the ๐‘๐‘–-distribution are computed for each new cap. Keywords: Cap, Complete cap, Finite projective space, Group action. 1. Introduction Let ๐น๐‘ž be the Galois field of ๐‘ž elements and ๐‘ƒ๐บ(3, ๐‘ž) be the projective space of dimension three. The points [๐‘ฅ0, ๐‘ฅ1, ๐‘ฅ2, ๐‘ฅ3] of ๐‘ƒ๐บ(3, ๐‘ž) are the 1-dimensional subspaces of the vector space ๐น๐‘ž 4 over ๐น๐‘ž. Subspaces of dimension two are called lines and dimension three planes. The number of points and the number of planes in ๐‘ƒ๐บ(3, ๐‘ž) is ๐‘ž3 + ๐‘ž2 + ๐‘ž + 1. The number of lines is (๐‘ž๐‘›+1 โˆ’ 1)(๐‘ž๐‘› โˆ’ 1)/(๐‘ž2 โˆ’ 1)(๐‘ž โˆ’ 1). There are ๐‘ž + 1 points on every line, ๐‘ž + 1 lines through every point, and ๐‘ž2 + ๐‘ž + 1 points on every plane; see [1],[2] and [3]. Many articles have been published about finding (๐‘˜, ๐‘Ÿ)-caps in the projective space especially caps of degree 2. The classification of caps and determine their completeness are hard tasks because of the number of points and lines in the projective space. So, the number of researchers focused on the theoretical research method to find a specific case gives complete caps. But no one has been able to give a full classification of the caps on specific projective spaces. In [4], Segre constructed complete ((3๐‘ž + 2), 2)-caps in ๐‘ƒ๐บ(3, 2โ„Ž). In [5], Alexander gave a generalization of Segreโ€™s construction of the complete caps in ๐‘ƒ๐บ(3, 2โ„Ž). In [6], Anbar et. al. used a geometrical object arc in the projective plane to produce complete caps of size ๐‘˜๐‘ž(๐‘โˆ’2)/2 in affine spaces of dimension ๐‘ โ‰ก 0 (๐‘š๐‘œ๐‘‘ 4). A computer search has been used by a number of authors to find new caps and complete caps such as Alexander et. al. [7] used a computer search in the finite projective spaces ๐‘ƒ๐บ(๐‘›, ๐‘ž) for the spectrum of possible sizes ๐‘˜ of complete ๐‘˜-caps. Also, in [8-10], a group action on the projective space of dimension three have been used to construct special types of caps https://creativecommons.org/licenses/by/4.0/ https://orcid.org/0000-0003-0195-2188 mailto:sawsave2233@gmail.com https://orcid.org/0000-0001-6415-1930 mailto:e.b.abdulkrareem@uomustansiriyah.edu.iq IHJPAS. 2024, 37( 3 ) 397 for ๐‘ž = 8,11,13,23. As in [9], in this paper, we did an extension of the caps that have been constructed in [10] with respect to their size and degree when ๐‘ž = 13. All the results obtained from this research could be of interest to many researchers because of their relationship to linear coding, see[11-18], as well as their relationship to cryptography, see [19-21] and also the network system, see [22-24]. Regarding finite projective spaces with a dimension higher than three, some studies have appeared recently discussing some projective concepts, as in [25-31]. The algorithms in this paper have been implemented by the GAP program [32]. 2. Preliminary Concepts Definition 2.1 [1]: A (๐‘˜, ๐‘Ÿ)-cap in ๐‘ƒ๐บ(๐‘› โ‰ฅ 3, ๐‘ž) is a set of ๐‘˜ points such that no ๐‘Ÿ + 1 points are collinear, but at most ๐‘Ÿ points of which lie in any line. Here, ๐‘Ÿ is called a degree of the (๐‘˜, ๐‘Ÿ)- cap. The (๐‘˜, ๐‘Ÿ)-cap is called a complete cap if it is not contained in (๐‘˜ + 1, ๐‘Ÿ)-cap. Definition 2.2 [2]: Let ๐พ be a cap of degree ๐‘Ÿ, an ๐‘–-secant of a ๐พ in ๐‘ƒ๐บ(๐‘›, ๐‘ž) is a line such that |๐‘˜ โˆฉ ๐œ‹| = ๐‘–. The number of ๐‘–-secants of ๐พ denoted by ๐œ๐‘–. Definition 2.3 [1]: Let ๐‘„ be a point not on the (๐‘˜, ๐‘Ÿ)-cap, ๐พ. The number of ๐‘–-secant of ๐พ passing through ๐‘„ denoted by ๐œŽ๐‘–(๐‘„). The number ๐œŽ๐‘Ÿ(๐‘„) of ๐‘Ÿ-secants is called the index of ๐‘„ with respect to ๐พ. Definition 2.4 [2]: The set of all points of index ๐‘– will be denoted by ๐ถ๐‘– and the cardinality of ๐ถ๐‘– is denoted by ๐‘๐‘–. The sequence (๐‘ก0, โ€ฆ , ๐‘ก๐‘Ÿ) will represent the secant distribution and the sequences (๐‘0, โ€ฆ , ๐‘๐‘‘) refer to the index distribution. Definition 2.5 [2,3]: The group of projectivities of ๐‘ƒ๐บ(๐‘›, ๐‘ž) is called the projective general linear group, and is denoted by ๐‘ƒ๐บ๐ฟ (๐‘› + 1, ๐‘ž). 3. (๐’Œ, ๐’“)-Caps in ๐‘ท๐‘ฎ(๐Ÿ‘, ๐Ÿ๐Ÿ‘) Let ๐น13 = โŒฉ๐œโŒช = {0, 1, ๐œ, ๐œ2, ๐œ3, ๐œ4, ๐œ5, ๐œ6, ๐œ7, ๐œ8, ๐œ9, ๐œ10, ๐œ11} be the 13th-order Galois field, where ๐œ is the primitive element of ๐น13. Let ๐‘† be the non-singular 4 ร— 4 companion matrix over ๐น13 ๐‘† = [ 0 1 0 0 0 0 1 0 0 0 ๐œ5 ๐œ3 0 1 0 1 ]. The cyclic subgroup โŒฉ๐‘†โŒช of ๐‘ƒ๐บ๐ฟ(4,13) is of order ๐œƒ3(13) = 2380. The projective space ๐‘ƒ๐บ(3,13) has ๐œƒ3(13) = 2380 points and planes, 31110 lines, 14 points on each line and 183 lines passing through each point. The number 2380 has 22 non-trivial divisors ๐‘ƒ which are: 2,4,5,7,10,14,17,20,28,34,35,68, 70,85,119,140,170,238,340,476,595,1190. The cyclic subgroups โŒฉ๐‘†๐‘ƒโŒช of the cyclic group โŒฉ๐‘†โŒช are constructed in [10] and used to formed caps. The following is the summary of these caps results. From the action of the subgroups โŒฉ๐‘†๐‘ƒโŒช on ๐‘ƒ๐บ(3,13) deduced 22 equivalence classes (orbits) in ๐‘ƒ๐บ(3,13) formed caps are summarized below: Let ๐œ’๐‘ƒ be the first orbit from the action of โŒฉ๐‘†๐‘ƒโŒช on ๐‘ƒ๐บ(3,13). 1. ๐œ’2 = {1 + 2๐‘˜|๐‘˜ = 0, โ€ฆ ,1189} is incomplete (1190,14)-cap. 2. ๐œ’4 = {1 + 4๐‘˜|๐‘˜ = 0, โ€ฆ ,594} is complete (595,7)-cap. 3. ๐œ’5 = {1 + 5๐‘˜|๐‘˜ = 0, โ€ฆ ,475} is incompletes (476,14)-cap. 4. ๐œ’7 = {1 + 7๐‘˜|๐‘˜ = 0, โ€ฆ ,339} is completes (340,4)-cap. 5. ๐œ’10 = {1 + 10๐‘˜|๐‘˜ = 0, โ€ฆ ,237} is incompletes (238,14)-cap. 6. ๐œ’14 = {1 + 14๐‘˜|๐‘˜ = 0, โ€ฆ ,169} is completes (170,2)-cap. IHJPAS. 2024, 37( 3 ) 398 7. ๐œ’17 = {1 + 17๐‘˜|๐‘˜ = 0, โ€ฆ ,139} is incompletes (140,14)-cap. 8. ๐œ’20 = {1 + 20๐‘˜|๐‘˜ = 0, โ€ฆ ,118} is incompletes (119,7)-cap. 9. ๐œ’28 = {1 + 28๐‘˜|๐‘˜ = 0, โ€ฆ ,84} is incompletes (85,2)-cap. 10. ๐œ’34 = {1 + 34๐‘˜|๐‘˜ = 0, โ€ฆ ,69} is incompletes (70,14)-cap. 11. ๐œ’35 = {1 + 35๐‘˜|๐‘˜ = 0, โ€ฆ ,67} is incompletes (68,3)-cap. 12. ๐œ’68 = {1 + 68๐‘˜|๐‘˜ = 0, โ€ฆ ,34} is incompletes (35,7)-cap. 13. ๐œ’70 = {1 + 70๐‘˜|๐‘˜ = 0, โ€ฆ ,33} is incompletes (34,2)-cap. 14. ๐œ’85 = {1 + 85๐‘˜|๐‘˜ = 0, โ€ฆ ,27} is incompletes (28,14)-cap. 15. ๐œ’119 = {1 + 119๐‘˜|๐‘˜ = 0, โ€ฆ ,19} is incompletes (20,2)-cap. 16. ๐œ’140 = {1 + 140๐‘˜|๐‘˜ = 0, โ€ฆ ,16} is incompletes (17,2)-cap. 17. ๐œ’170 = {1 + 170๐‘˜|๐‘˜ = 0, โ€ฆ ,13} is incompletes (14,14)-cap. 18. ๐œ’238 = {1 + 238๐‘˜|๐‘˜ = 0, โ€ฆ ,9} is incompletes (10,2)-cap. 19. ๐œ’340 = {1 + 340๐‘˜|๐‘˜ = 0, โ€ฆ ,6} is incompletes (7,7)-cap. 20. ๐œ’476 = {1 + 476๐‘˜|๐‘˜ = 0, โ€ฆ ,4} is incompletes (5,2)-cap. 21. ๐œ’595 = {1 + 595๐‘˜|๐‘˜ = 0, โ€ฆ ,3} is incompletes (4,2)-cap. 22. ๐œ’1190 = {1,1191} is incompletes (2,2)-cap. 2. Extension of Caps An exhaustive computer search proves the following theorem: Theorem: The caps ๐œ’๐‘– , ๐‘– = 4,7,14,20,28,35,68,70,119,140,238,340,476,595,1190 can be extended by their sizes and degrees to complete caps. Proof: Let ๐’Ÿ๐‘ƒ ๐‘๐‘– = ๐œ’๐‘ƒโ‹ƒ๐‘๐‘–, where ๐‘๐‘– is the set of addition points, 1 โ‰ค ๐‘– โ‰ค 14. 1. The line ๐ˆ(0,0,1,0,0,0) meets the cap ๐œ’4 in 7 points, so, seven extension points have been added to ๐œ’๐‘ƒ in the following orders: 4, 144, 358, 470, 754, 755, 923. Let ๐‘1 = {4}, ๐’Ÿ4 ๐‘1 = ๐œ’4โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’4 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’4 ๐‘1 is (596,8)-cap and ๐‘๐‘– values are ๐‘0 = 1736, ๐‘1 = 48. Since ๐‘0 โ‰  0, then ๐œ’4 ๐‘1 is incomplete. The (596,8)-cap will be complete when you add 196 points to it. Let ๐‘2 = {4, 144}, ๐’Ÿ4 ๐‘2 = ๐œ’4โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’4 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’4 ๐‘2 is (597,9)-cap and ๐‘๐‘– values are ๐‘0 =1778, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’4 ๐‘2 is incomplete. The (597,9)-cap will be complete when you add 413 points to it. Let ๐‘3 = {4, 144,358}, ๐’Ÿ4 ๐‘3= ๐œ’4โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’4 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’4 ๐‘3 is (598,10)-cap and ๐‘๐‘– values are ๐‘0 = 1778, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’4 ๐‘3 is incomplete. The (598,10)-cap will be complete when you add 600 points to it. Let ๐‘4 = {4, 144,358,470}, ๐’Ÿ4 ๐‘4 = ๐œ’4โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’4 ๐‘4 and lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’4 ๐‘4 is (599,11)-cap and ๐‘๐‘– values are ๐‘0 = 1778, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’4 ๐‘4 is incomplete. The (599,11)-cap will be complete when you add 702 points to it. Let ๐‘5 = {4, 144,358,470,754}, ๐’Ÿ4 ๐‘5 = ๐œ’4โ‹ƒ๐‘5. The maximum number of intersection points between ๐œ’4 ๐‘5 and lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’4 ๐‘5 is (600,12)-cap and ๐‘๐‘– values are ๐‘0 = IHJPAS. 2024, 37( 3 ) 399 1778, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’4 ๐‘5 is incomplete. The (600,12)-cap will be complete when you add 1016 points to it. Let ๐‘6 = {4, 144,358,470,754,755}, ๐’Ÿ4 ๐‘6 = ๐œ’4โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’4 ๐‘6 and lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’4 ๐‘6 is (601,13)-cap and ๐‘๐‘– values are ๐‘0 = 1778, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’4 ๐‘6 is incomplete. The (601,13)-cap will be complete when you add 1148 points to it. Let ๐‘7 = {4, 144,358,470,754,755,923}, ๐’Ÿ4 ๐‘7 = ๐œ’4โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’4 ๐‘7 and lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’4 ๐‘7 is (602,14)-cap and ๐‘๐‘– values are ๐‘0 = 1778. Since ๐‘0 โ‰  0, then ๐œ’4 ๐‘7 is incomplete. The (602,14)-cap will be complete when you add 1778 points to it. 2. The line ๐ˆ(0,1,0,0,0,0) meets the cap ๐œ’7 in 4 points, so we have ten extension points to be added to ๐œ’๐‘ƒ in the following orders: 3, 249, 488, 602, 1006, 1075, 1232, 1251, 1433, 2341. Let ๐‘1 = {3}, ๐’Ÿ7 ๐‘1 = ๐œ’7โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’7 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’7 ๐‘1 is (341,5)-cap and ๐‘๐‘– values are ๐‘0 = 1751, ๐‘1 = 288. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘1 is incomplete. The (341,5)-cap will be complete when you add 66 points to it. Let ๐‘2 = {3, 249}, ๐’Ÿ7 ๐‘2= ๐œ’7โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’7 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’7 ๐‘2 is (342,6)-cap and ๐‘๐‘– values are ๐‘0 =1011, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘2 is incomplete. The (342,6)-cap will be complete when you add 196 points to it. Let ๐‘3 = { 3, 249, 488}, ๐’Ÿ7 ๐‘3 = ๐œ’7 โ‹ƒ ๐‘3. The maximum number of the intersection points between ๐œ’7 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’7 ๐‘3 is (343,7)-cap and ๐‘๐‘– values are ๐‘0 = 2030, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘3 is incomplete. The (343,7)-cap will be complete when you add 335 points to it. Let ๐‘4 = { 3, 249, 488, 602}, ๐’Ÿ7 ๐‘4= ๐œ’7 โ‹ƒ ๐‘4. The maximum number of the intersection points between ๐œ’7 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’7 ๐‘4 is (344,8)-cap and ๐‘๐‘– values are ๐‘0 = 2030, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘4 is incomplete. The (344,8)-cap will be complete when you add 463 points to it. Let ๐‘5 = { 3, 249, 488, 602, 1006}, ๐’Ÿ7 ๐‘5= ๐œ’7 โ‹ƒ ๐‘5. The maximum number of the intersection points between ๐œ’7 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’7 ๐‘5 is (345,9)-cap and ๐‘๐‘– values are ๐‘0 = 2030, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘5 is incomplete. The (345,9)-cap will be complete when you add 685 points to it. Let ๐‘6 = {3, 249, 488, 602, 1006, 1075}, ๐’Ÿ7 ๐‘6 = ๐œ’7 โ‹ƒ ๐‘6. The maximum number of the intersection points between ๐œ’7 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’7 ๐‘6 is (346,10)-cap and ๐‘๐‘– values are ๐‘0 = 2030, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘6 is incomplete. The (346,10)-cap will be complete when you add 816 points to it. Let ๐‘7 = {3, 249, 488, 602, 1006, 1075, 1232}, ๐’Ÿ7 ๐‘7= ๐œ’7โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’7 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’7 ๐‘7 is (347,11)- cap and ๐‘๐‘– values are ๐‘0 = 2030, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘7 is incomplete. The (347,11)- cap will be complete when you add 991 points to it. IHJPAS. 2024, 37( 3 ) 400 Let ๐‘8 = {3, 249, 488, 602, 1006, 1075, 1232, 1251}, ๐’Ÿ7 ๐‘8 = ๐œ’7โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’7 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’7 ๐‘8 is (348,12)- cap and ๐‘๐‘– values are ๐‘0 = 2030, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘8 is incomplete. The (348,12)- cap will be complete when you add 1180 points to it. Let ๐‘9 = {3, 249, 488, 602, 1006, 1075, 1232, 1251, 1433}, ๐’Ÿ7 ๐‘9= ๐œ’7โ‹ƒ๐‘9. The maximum number of intersection points between ๐œ’7 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’7 ๐‘9 is (349,13)-cap and ๐‘๐‘– values are ๐‘0 = 2030, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘9 is incomplete. The (349,13)-cap will be complete when you add 1395 points to it. Let ๐‘10 = {3, 249, 488, 602, 1006, 1075, 1232, 1251, 1433, 2341}, ๐’Ÿ7 ๐‘10 = ๐œ’7 โ‹ƒ๐‘10. The maximum number of the intersection points between ๐œ’7 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’7 ๐‘10 is (350,14)-cap and ๐‘๐‘– values are ๐‘0 = 2030. Since ๐‘0 โ‰  0, then ๐œ’7 ๐‘10 is incomplete. The (350,14)-cap will be complete when adding 2030 points to it. 3. The line ๐ˆ(0,1,0,0,0,0) meets the cap ๐œ’14 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 3,176,249,488,602,638,1006,1075,1232,1251,1433, 2341. Let ๐‘1 = {3}, ๐’Ÿ14 ๐‘1= ๐œ’14โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’14 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’14 ๐‘1 is (171,3)-cap and ๐‘๐‘– values are ๐‘0 = 1351, ๐‘1 = 858. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘1 is incomplete. The (171,3)-cap will be complete when you add 20 points to it. Let ๐‘2 = {3, 176}, ๐’Ÿ14 ๐‘2= ๐œ’14โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’14 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’14 ๐‘2 is (172,4)-cap and ๐‘๐‘– values are ๐‘0 =2198, ๐‘1=10. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘2 is incomplete. The (172,4)-cap will be complete when adding 119 points to it. Let ๐‘3 = {3, 176, 249}, ๐’Ÿ14 ๐‘3= ๐œ’14 โ‹ƒ ๐‘3. The maximum number of the intersection points between ๐œ’14 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’14 ๐‘3 is (173,5)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘3 is incomplete. The (173,5)-cap will be complete when you add 254 points to it. Let ๐‘4 = {3, 176, 249, 488}, ๐’Ÿ14 ๐‘4 = ๐œ’14 โ‹ƒ ๐‘4. The maximum number of the intersection points between ๐œ’14 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’14 ๐‘4 is (174,6)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘4 is incomplete. The (174,6)-cap will be complete when you add 352 points to it. Let ๐‘5 = {3, 176, 249, 488, 602}, ๐’Ÿ14 ๐‘5 = ๐œ’14โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’14 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’14 ๐‘5 is (175,7)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘5 is incomplete. The (175,7)-cap will be complete when you add 537 points to it. Let ๐‘6 = {3, 176, 249, 488, 602, 638 }, ๐’Ÿ14 ๐‘6= ๐œ’14โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’14 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’14 ๐‘6 is (176,8)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘6 is incomplete. The (176,8)-cap will be complete when you add 629 points to it. Let ๐‘7 = { 3, 176, 249, 488, 602, 638, 1006}, ๐’Ÿ14 ๐‘7= ๐œ’14โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’14 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’14 ๐‘7 is (177,9)-cap IHJPAS. 2024, 37( 3 ) 401 and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘7 is incomplete. The (177,9)-cap will be complete when you add 818 points to it. Let ๐‘8 = {3, 176, 249, 488, 602, 638,1006, 1075}, ๐’Ÿ14 ๐‘8= ๐œ’14โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’14 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’14 ๐‘8 is (178,10)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘8 is incomplete. The (178,10)-cap will be complete when you add 970 points to it. Let ๐‘9 = { 3, 176, 249, 488, 602, 638, 1006, 1075, 1232}, ๐’Ÿ14 ๐‘9 = ๐œ’14 โ‹ƒ ๐‘9. The maximum number of the intersection points between ๐œ’14 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’14 ๐‘9 is (179,11)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘9 is incomplete. The (179,11)-cap will be complete when you add 1200 points to it. Let ๐‘10 = {3, 176, 249, 488, 602, 638, 1006, 1075, 1232, 1251}, ๐’Ÿ14 ๐‘10 = ๐œ’14 โ‹ƒ ๐‘10. The maximum number of the intersection points between ๐œ’14 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’14 ๐‘10 is (180,12)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘10 is incomplete. The (180,12)-cap will be complete when you add 1325 points to it. Let ๐‘11 = {3, 176, 249, 488, 602, 638, 1006, 1075, 1232, 1251, 1433}, ๐’Ÿ14 ๐‘11 = ๐œ’14โ‹ƒ๐‘11. The maximum number of the intersection points between ๐œ’14 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’14 ๐‘11 is (181,13)-cap and ๐‘๐‘– values are ๐‘0 = 2198, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’14 ๐‘11 is incomplete. The (181,13)-cap will be complete when you add 1516 points to it. Let ๐‘12 = {3, 176, 249, 488, 602, 638, 1006, 1075, 1232, 1251, 1433, 2341} . Put ๐’Ÿ14 ๐‘12= ๐œ’14โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’14 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’14 ๐‘12 is (182,14)-cap and ๐‘๐‘– values are ๐‘0 = 2198. Since ๐‘0 โ‰ 0, then ๐œ’14 ๐‘12 is incomplete. The (182,14)-cap will be complete when you add 2198 points to it. 4. The line ๐ˆ(๐œ11, 1,0,0,0,0) meets the cap ๐œ’20 in 7 points, so we have seven extension points that can be added to ๐œ’๐‘ƒ, as in the following orders: 171, 511, 851, 1191, 1531, 1871, 2211. Let ๐‘1 = {171}, ๐’Ÿ20 ๐‘1= ๐œ’20โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’20 ๐‘1 and the lines of ๐‘ƒ๐บ(3 13) are eight, so ๐œ’20 ๐‘1 is (120,8)-cap and ๐‘๐‘– values are ๐‘0 = 2254, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’20 ๐‘1 is incomplete. The (120,8)-cap will be complete when you add 658 points to it. Let ๐‘2 = {171, 511}, ๐’Ÿ20 ๐‘2= ๐œ’20โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’20 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’20 ๐‘2 is (121,9)-cap and ๐‘๐‘– values are ๐‘0 = 2254, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’20 ๐‘2 is incomplete. The (121,9)-cap will be complete when you add 827 points to it. Let ๐‘3 = { 171, 511, 851}, ๐’Ÿ20 ๐‘3 = ๐œ’20 โ‹ƒ ๐‘3. The maximum number of the intersection points between ๐œ’20 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’20 ๐‘3 is (122,10)-cap and ๐‘๐‘– values are ๐‘0 = 2254, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’20 ๐‘3 is incomplete. The (122,10)-cap will be complete when you add 1033 points to it. Let ๐‘4 = {171, 511, 851, 1191}, ๐’Ÿ20 ๐‘4 = ๐œ’20โ‹ƒ๐‘4. The maximum number of intersection points between ๐œ’20 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’20 ๐‘4 is (123,11)-cap and ๐‘๐‘– values are ๐‘0 = 2254, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’20 ๐‘4 is incomplete. The (123,11)-cap will be complete when you add 1250 points to it. Let ๐‘5 = {171, 511, 851, 1191, 1531 }, ๐’Ÿ20 ๐‘5= ๐œ’20โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’20 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’20 ๐‘5 is (124,12)-cap IHJPAS. 2024, 37( 3 ) 402 and ๐‘๐‘– values are ๐‘0 = 2254, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’20 ๐‘5 is incomplete. The (124,12)- cap will be complete when you add 1383 points to it. Let ๐‘6 = {171, 511, 851, 1191, 1531, 1871}, ๐’Ÿ20 ๐‘6= ๐œ’20โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’20 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’20 ๐‘6 is (125,13)- cap and ๐‘๐‘– values are ๐‘0 = 2254, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’20 ๐‘6 is incomplete. The (125,13)-cap will be complete when you add 1555 points to it. Let ๐‘7 = {171, 511, 851, 1191,1531, 1871, 2211}, ๐’Ÿ20 ๐‘7= ๐œ’20โ‹ƒ ๐‘7. The maximum number of the intersection points between ๐œ’20 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’20 ๐‘7 is (126,14)-cap and ๐‘๐‘– values are ๐‘0 = 2254. Since ๐‘0 โ‰  0, then ๐œ’20 ๐‘7 is incomplete. The (126,14)-cap will be complete when you add 2254 points to it. 5. The line ๐ˆ(0,0,1,0,0,0) meets the cap ๐œ’28 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 4,144,358,470,593,754,755,923,1213,2105,2165, 2369. Let ๐‘1 = {4}, ๐’Ÿ28 ๐‘1= ๐œ’28โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’28 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three so ๐œ’28 ๐‘1 is (86,3)-cap and ๐‘๐‘– values are ๐‘0 = 2096, ๐‘1 = 198. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘1 is incomplete. The (86,3)-cap will be complete when you add 74 points to it. Let ๐‘2 = {4, 144}, ๐’Ÿ28 ๐‘2 = ๐œ’28โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’28 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four so ๐œ’28 ๐‘2 is (87,4)-cap and ๐‘๐‘– values are ๐‘0 =2283, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘2 is incomplete. The (87,4)-cap will be complete when you add 176 points to it. Let ๐‘3 = {4, 144, 358}, ๐’Ÿ28 ๐‘3= ๐œ’28โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’28 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’28 ๐‘3 is (88,5)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘3 is incomplete. The (88,5)-cap will be complete when you add 319 points to it. Let ๐‘4 = {4, 144, 358, 470}. Put ๐’Ÿ28 ๐‘4= ๐œ’28โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’28 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’28 ๐‘4 is (89,6)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘4 is incomplete. The (89,6)-cap will be complete when adding 433 points to it. Let ๐‘5 = {4, 144, 358, 470, 593}, ๐’Ÿ28 ๐‘5= ๐œ’28โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’28 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’28 ๐‘5 is (90,7)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘5 is incomplete. The (90,7)-cap will be complete when you add 623 points to it. Let ๐‘6 = { 4, 144, 358, 470, 593, 754}, ๐’Ÿ28 ๐‘6 = ๐œ’28 โ‹ƒ ๐‘6. The maximum number of the intersection points between ๐œ’28 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’28 ๐‘6 is (91,8)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘6 is incomplete. The (91,8)-cap will be complete when you add 671 points to it. Let ๐‘7 = {4, 144, 358, 470, 593, 754, 755}, ๐’Ÿ28 ๐‘7 = ๐œ’28โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’28 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’28 ๐‘7 is (92,9)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘7 is incomplete. The (92,9)-cap will be complete when you add 892 points to it. Let ๐‘8 = {4, 144, 358, 470, 593, 754, 755, 923}, ๐’Ÿ28 ๐‘8 = ๐œ’28โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’28 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’28 ๐‘8 is (93,10)-cap and IHJPAS. 2024, 37( 3 ) 403 ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘8 is incomplete. The (93,10)-cap will be complete when you add 1047 points to it. Let ๐‘9 = {4, 144, 358, 470, 593, 754, 755, 923, 1213, }. Put ๐’Ÿ28 ๐‘9= ๐œ’28 โ‹ƒ ๐‘9. The maximum number of the intersection points between ๐œ’28 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’28 ๐‘9 is (94,11)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘9 is incomplete. The (94,11)-cap will be complete when you add 1299 points to it. Let ๐‘10 = { 4, 144, 358, 470, 593, 754, 755, 923, 1213, 2105}. Put ๐’Ÿ28 ๐‘10 = ๐œ’28โ‹ƒ ๐‘10. The maximum number of the intersection points between ๐œ’28 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’28 ๐‘10 is (95,12)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘10 is incomplete. The (95,12)-cap will be complete when you add 1367 points to it. Let ๐‘11 = {4, 144, 358, 470, 593, 754, 755, 923, 1213, 2105, 2165}, ๐’Ÿ28 ๐‘11 = ๐œ’28โ‹ƒ ๐‘11. The maximum number of the intersection points between ๐œ’28 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’28 ๐‘11 is (96,13)-cap and ๐‘๐‘– values are ๐‘0 = 2283, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘11 is incomplete. The (96,13)-cap will be complete when you add 1577 points to it. Let ๐‘12 = {4, 144, 358, 470, 593, 754, 755, 923, 1213, 2105, 2165, 2369}, ๐’Ÿ28 ๐‘12 = ๐œ’28โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’28 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’28 ๐‘12 is (97,14)-cap and ๐‘๐‘– values are ๐‘0 = 2283. Since ๐‘0 โ‰  0, then ๐œ’28 ๐‘12 is incomplete. The (97,14)-cap will be complete when you add 2283 points to it. 6. The line ๐ˆ(๐œ9, ๐œ10, 1,0,0,0) meets the cap ๐œ’35 in 3 points, so we have eleven extension points that can be added to ๐œ’๐‘ƒ , as in the following order: 356,565,718,1049,1054,1314,1377,1756, 1818,2253,2331. Let ๐‘1 = {356}, ๐’Ÿ35 ๐‘1= ๐œ’35โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’35 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’35 ๐‘1 is (69,4)-cap and ๐‘๐‘– values are ๐‘0 = 2291, ๐‘1 = 20. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘1 is incomplete. The (69,4)-cap will be complete when you add 189 points to it. Let ๐‘2 = {356, 565}, ๐’Ÿ35 ๐‘2= ๐œ’35โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’35 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’35 ๐‘2 is (70,5)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘2 is incomplete. The (70,5)-cap will be complete when you add 334 points to it. Let ๐‘3 = {356, 565, 718}, ๐’Ÿ35 ๐‘3 = ๐œ’35 โ‹ƒ ๐‘3. The maximum number of the intersection points between ๐œ’35 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’35 ๐‘3 is (71,6)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘3 is incomplete. The (71,6)-cap will be complete when you add 486 points to it. Let ๐‘4 = {356, 565, 718, 1049}, ๐’Ÿ35 ๐‘4 = ๐œ’35โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’35 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’35 ๐‘4 is (72,7)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘4 is incomplete. The (72,7)-cap will be complete when you add 627 points to it. Let ๐‘5 = {356, 565, 718, 1049, 1054}, ๐’Ÿ35 ๐‘5= ๐œ’35โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’35 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’35 ๐‘5 is (73,8)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘5 is incomplete. The (73,8)-cap will be complete when you add 692 points to it. IHJPAS. 2024, 37( 3 ) 404 Let ๐‘6 = {356, 565, 718, 1049, 1054, 1314}, ๐’Ÿ35 ๐‘6 = ๐œ’35โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’35 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’35 ๐‘6 is (74,9)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘6 is incomplete. The (74,9)-cap will be complete when you add 876 points to it. Let ๐‘7 = {356, 565, 718, 1049, 1054, 1314, 1377}, ๐’Ÿ35 ๐‘7= ๐œ’35โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’35 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’35 ๐‘7 is (75,10)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘7 is incomplete. The (75,10)-cap will be complete when you add 1037 points to it. Let ๐‘8 = { 356, 565, 718, 1049, 1054, 1314, 1377, 1756}, ๐’Ÿ35 ๐‘8 = ๐œ’35โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’35 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’35 ๐‘8 is (76,11)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘8 is incomplete. The (76,11)-cap will be complete when you add 1312 points to it. Let ๐‘9 = {356, 565, 718, 1049, 1054, 1314, 1377, 1756, 1818}. Put ๐’Ÿ35 ๐‘9= ๐œ’35โ‹ƒ๐‘9. The maximum number of intersection points between ๐œ’35 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’35 ๐‘9 is (77,12)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘9 is incomplete. The (77,12)-cap will be complete when you add 1401 points to it. Let ๐‘10 = {356, 565, 718, 1049, 1054, 1314, 1377, 1756, 1818, 2253}, ๐’Ÿ35 ๐‘10 = ๐œ’35โ‹ƒ๐‘10. The maximum number of the intersection points between ๐œ’35 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’35 ๐‘10 is (78,13)-cap and ๐‘๐‘– values are ๐‘0 = 2301, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘10 is incomplete. The (78,13)-cap will be complete when you add 1591 points to it. Let ๐‘11 = {356, 565, 718, 1049, 1054, 1314, 1377, 1756, 1818, 2253, 2331}. Put ๐’Ÿ35 ๐‘11 = ๐œ’35 โ‹ƒ ๐‘11. The maximum number of the intersection points between ๐œ’35 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’35 ๐‘11 is (79,14)-cap and ๐‘๐‘– values are ๐‘0 = 2301. Since ๐‘0 โ‰  0, then ๐œ’35 ๐‘11 is incomplete. The (79,14)-cap will be complete when you add 2301 points to it. 7. The line ๐ˆ(๐œ11, 1,0,0,0,0) meets the cap ๐œ’68 in 7 points, so we have seven extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 171, 511, 851, 1191, 1531, 1871, 2211. Let ๐‘1 = {171}, ๐’Ÿ68 ๐‘1= ๐œ’68โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’68 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’68 ๐‘1 is (36,8)-cap and ๐‘๐‘– values are ๐‘0 = 2338, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’68 ๐‘1 is incomplete. The (36,8)-cap will be complete when you add 709 points to it. Let ๐‘2 = {171, 511}, ๐’Ÿ68 ๐‘2= ๐œ’68โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’68 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’68 ๐‘2 is (37,9)-cap and ๐‘๐‘– values are ๐‘0 = 2338, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’68 ๐‘2 is incomplete. The (37,9)-cap will be complete when you add 901 points to it. Let ๐‘3 = {171, 511, 851}, ๐’Ÿ68 ๐‘3 = ๐œ’68โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’68 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’68 ๐‘3 is (38,10)-cap and ๐‘๐‘– values are ๐‘0 = 2338, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’68 ๐‘3 is incomplete. The (38,10)-cap will be complete when you add 1065 points to it. Let ๐‘4 = {171, 511, 851, 1191}, ๐’Ÿ68 ๐‘4 = ๐œ’68โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’68 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’68 ๐‘4 is (39,11)-cap and ๐‘๐‘– values IHJPAS. 2024, 37( 3 ) 405 are ๐‘0 = 2338, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’68 ๐‘4 is incomplete. The (39,11)-cap will be complete when you add 1395 points to it. Let ๐‘5 = {171, 511, 851, 1191, 1531}, ๐’Ÿ68 ๐‘5= ๐œ’68โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’68 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’68 ๐‘5 is (40,12)-cap and ๐‘๐‘– values are ๐‘0 = 2338, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’68 ๐‘5 is incomplete. The (40,12)-cap will be complete when you add 1427 points to it. Let ๐‘6 = {171, 511, 851, 1191, 1531, 1871}, ๐’Ÿ68 ๐‘6 = ๐œ’68โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’68 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’68 ๐‘6 is (41,13)-cap and ๐‘๐‘– values are ๐‘0 = 2338, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’68 ๐‘6 is incomplete. The (41,13)-cap will be complete when you add 1615 points to it. Let ๐‘7 = {171, 511, 851, 1191, 1531, 1871, 2211}, ๐’Ÿ68 ๐‘7= ๐œ’68โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’68 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’68 ๐‘7 is (42,14)- cap and ๐‘๐‘– values are ๐‘0 = 2338. Since ๐‘0 โ‰  0, then ๐œ’68 ๐‘7 is incomplete. The (42,14)-cap will be complete when you add 2338 points to it. 8. The line ๐ˆ(๐œ5, ๐œ5, 1,0,0,0) meets the cap ๐œ’70 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 20,202,772,1110,1150,1152,1325,1398, 1637,1787,2155,2224. Let ๐‘1 = {20}, ๐’Ÿ70 ๐‘1 = ๐œ’70โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’70 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’70 ๐‘1 is (35,3)-cap and ๐‘๐‘– values are ๐‘0 = 2323, ๐‘1 = 22. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘1 is incomplete. The (35,3)-cap will be complete when you add 109 points to it. Let ๐‘2 = {20, 202, }, ๐’Ÿ70 ๐‘2= ๐œ’70โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’70 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’70 ๐‘2 is (36,4)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘2 is incomplete. The (36,4)-cap will be complete when you add 226 points to it. Let ๐‘3 = {20, 202, 772}, ๐’Ÿ70 ๐‘3= ๐œ’70โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’70 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’70 ๐‘3 is (37,5)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘3 is incomplete. The (37,5)-cap will be complete when you add 368 points to it. Let ๐‘4 = {20, 202, 772, 1110}, ๐’Ÿ70 ๐‘4= ๐œ’70โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’70 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’70 ๐‘4 is (38,6)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘4 is incomplete. The (38,6)-cap will be complete when you add 468 points to it. Let ๐‘5 = {20, 202, 772, 1110, 1150}, ๐’Ÿ70 ๐‘5 = ๐œ’70โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’70 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’70 ๐‘5 is (39,7)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘5 is incomplete. The (39,7)-cap will be complete when you add 639 points to it. Let ๐‘6 = { 20, 202, 772, 1110, 1150, 1152}, ๐’Ÿ70 ๐‘6 = ๐œ’70โ‹ƒ ๐‘6. The maximum number of the intersection points between ๐œ’70 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’70 ๐‘6 is (40,8)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘6 is incomplete. The (40,8)-cap will be complete when you add 697 points to it. IHJPAS. 2024, 37( 3 ) 406 Let ๐‘7 = {20, 202, 772, 1110, 1150, 1152, 1325}, ๐’Ÿ70 ๐‘7= ๐œ’70โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’70 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’70 ๐‘7 is (41,9)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘7 is incomplete. The (41,9)-cap will be complete when you add 989 points to it. Let ๐‘8 = { 20, 202, 772, 1110, 1150, 1152, 1325, 1398}, ๐’Ÿ70 ๐‘8= ๐œ’70โ‹ƒ ๐‘8. The maximum number of the intersection points between ๐œ’70 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’70 ๐‘8 is (42,10)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘8 is incomplete. The (42,10)-cap will be complete when you add 1056 points to it. Let ๐‘9 = {20, 202, 772, 1110, 1150, 1152, 1325, 1398, 1637}, ๐’Ÿ70 ๐‘9= ๐œ’70โ‹ƒ๐‘9. The maximum number of the intersection points between ๐œ’70 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’70 ๐‘9 is (43,11)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘9 is incomplete. The (43,11)-cap will be complete when you add 1330 points to it. Let ๐‘10 = {20, 202, 772, 1110, 1150, 1152, 1325, 1398, 1637, 1787}, ๐’Ÿ70 ๐‘10 = ๐œ’70โ‹ƒ๐‘10. The maximum number of the intersection points between ๐œ’70 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’70 ๐‘10 is (44,12)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘10 is incomplete. The (44,12)-cap will be complete when you add 1421 points to it. Let ๐‘11 = {20, 202, 772, 1110, 1150, 1152, 1325, 1398, 1637, 1787,2155}. Put ๐’Ÿ70 ๐‘11 = ๐œ’70โ‹ƒ๐‘11. The maximum number of the intersection points between ๐œ’70 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’70 ๐‘11 is (45,13)-cap and ๐‘๐‘– values are ๐‘0 = 2334, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘11 is incomplete. The (45,13)-cap will be complete when you add 1612 points to it. Let ๐‘12 = {20, 202, 772, 1110, 1150, 1152, 1325, 1398, 1637, 1787, 2155, 2224}. Put ๐’Ÿ70 ๐‘12= ๐œ’70โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’70 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’70 ๐‘12 is (46,14)-cap and ๐‘๐‘– values are ๐‘0 = 2334. Since ๐‘0 โ‰  0, then ๐œ’70 ๐‘12 is incomplete. The (46,14)-cap will be complete when you add 2334 points to it. 9. The line ๐ˆ(0,0,1,0,0,0) meets the cap ๐œ’119 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 4, 144, 470, 593, 754, 755,923,1213,2017, 2105, 2165, 2369. Let ๐‘1 = {4}, ๐’Ÿ119 ๐‘1 = ๐œ’119โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’119 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’119 ๐‘1 is (21,3)-cap and ๐‘๐‘– values are ๐‘0 = 2337, ๐‘1 = 22. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘1 is incomplete. The (21,3)-cap will be complete when you add 117 points to it. Let ๐‘2 = {4, 144}, ๐’Ÿ119 ๐‘2 = ๐œ’119โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’119 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) four, so ๐œ’119 ๐‘2 is (22,4)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘2 is incomplete. The (22,4)-cap will be complete when you add 241 points to it. Let ๐‘3 = {4, 144, 470}, ๐’Ÿ119 ๐‘3 = ๐œ’119โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’119 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’119 ๐‘3 is (23,5)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘3 is incomplete. The (23,5)-cap will be complete when you add 392 points to it. IHJPAS. 2024, 37( 3 ) 407 Let ๐‘4 = {4, 144, 470, 593}, ๐’Ÿ119 ๐‘4 = ๐œ’119โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’119 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’119 ๐‘4 is (24,6)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘4 is incomplete. The (24,6)-cap will be complete when you add 507 points to it. Let ๐‘5 = {4, 144, 470, 593, 754}, ๐’Ÿ119 ๐‘5 = ๐œ’119โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’119 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’119 ๐‘5 is (25,7)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘5 is incomplete. The (25,7)-cap will be complete when you add 639 points to it. Let ๐‘6 = {4, 144, 470, 593, 754, 755}, ๐’Ÿ119 ๐‘6 = ๐œ’119โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’119 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’119 ๐‘6 is (26,8)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘6 is incomplete. The (26,8)-cap will be complete when you add 734 points to it. Let ๐‘7 = {4, 144, 470, 593, 754, 755, 923}, ๐’Ÿ119 ๐‘7 = ๐œ’119โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’119 4,144,470,593,754,755,923 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’119 ๐‘7 is (27,9)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘7 is incomplete. The (27,9)-cap will be complete when you add 891 points to it. Let ๐‘8 = {4, 144, 470, 593, 754, 755, 923, 1213}, ๐’Ÿ119 ๐‘8 = ๐œ’119โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’119 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’119 ๐‘8 is (28,10)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘8 is incomplete. The (28,10)- cap will be complete when you add 1066 points to it. Let ๐‘9 = {4, 144, 470, 593, 754, 755, 923, 1213, 2017}, ๐’Ÿ119 ๐‘9 = ๐œ’119 โ‹ƒ ๐‘9. The maximum number of the intersection points between ๐œ’119 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’119 ๐‘9 is (29,11)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘9 is incomplete. The (29,11)-cap will be complete when you add 1335 points to it. Let ๐‘10 = {4, 144, 470, 593, 754, 755, 923, 1213, 2017, 2105}, ๐’Ÿ119 ๐‘10 = ๐œ’119โ‹ƒ ๐‘10. The maximum number of the intersection points between ๐œ’119 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’119 ๐‘10 is (30,12)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘10 is incomplete. The (30,12)-cap will be complete when you add 1444 points to it. Let ๐‘11 = {4, 144, 470, 593, 754, 755, 923, 1213, 2017, 2105, 2165}, ๐’Ÿ119 ๐‘11 = ๐œ’119โ‹ƒ๐‘11. The maximum number of the intersection points between ๐œ’119 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’119 ๐‘11 is (31,13)-cap and ๐‘๐‘– values are ๐‘0 = 2348, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘11 is incomplete. The (31,13)-cap will be complete when you add 1623 points to it. Let ๐‘12 = {4, 144, 470, 593, 754, 755, 923, 1213, 2017, 2105, 2165, 2369}. Put ๐’Ÿ119 ๐‘12 = ๐œ’119โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’119 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’119 ๐‘12 is (32,14)-cap and ๐‘๐‘– values are ๐‘0 = 2348. Since ๐‘0 โ‰  0, then ๐œ’119 ๐‘12 is incomplete. The (32,14)-cap will be complete when you add 2348 points to it. 10. The line ๐ˆ(๐œ9, ๐œ10, 1,0,0,0) meets the cap ๐œ’140 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 36,356,565,718,1049,1054,1314,1377, 1756,1818,2253,2331. Let ๐‘1 = {36}, ๐’Ÿ140 ๐‘1 = ๐œ’140โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’140 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’140 ๐‘1 is (18,3)-cap and ๐‘๐‘– values are ๐‘0 = 2340, ๐‘1 = IHJPAS. 2024, 37( 3 ) 408 22. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘1 is incomplete. The (18,3)-cap will be complete when you add 128 points to it. Let ๐‘2 = {36, 356}, ๐’Ÿ140 ๐‘2 = ๐œ’140 โ‹ƒ ๐‘2. The maximum number of the intersection points between ๐œ’140 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’140 ๐‘2 is (19,4)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘2 is incomplete. The (19,4)-cap will be complete when you add 248 points to it. Let ๐‘3 = {36, 356, 565}, ๐’Ÿ140 ๐‘3 = ๐œ’140โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’140 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’140 ๐‘3 is (20,5)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘3 is incomplete. The (20,5)-cap will be complete when you add 388 points to it. Let ๐‘4 = {36, 356, 565, 718}, ๐’Ÿ140 ๐‘4 = ๐œ’140โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’140 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’140 ๐‘4 is (21,6)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘4 is incomplete. The (21,6)-cap will be complete when you add 489 points to it. Let ๐‘5 = {36, 356, 565, 718, 1049}, ๐’Ÿ140 ๐‘5 = ๐œ’140โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’140 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’140 ๐‘5 is (22,7)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘5 is incomplete. The (22,7)-cap will be complete when you add 647 points to it. Let ๐‘6 = { 36, 356, 565, 718, 1049, 1054}, ๐’Ÿ140 ๐‘6 = ๐œ’140 โ‹ƒ ๐‘6. The maximum number of the intersection points between ๐œ’140 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’140 ๐‘6 is (23,8)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘6 is incomplete. The (23,8)-cap will be complete when you add 707 points to it. Let ๐‘7 = {36, 356, 565, 718, 1049, 1054, 1314}, ๐’Ÿ140 ๐‘7 = ๐œ’140โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’140 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’140 ๐‘7 is (24,9)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘7 is incomplete. The (24,9)-cap will be complete when you add 904 points to it. Let ๐‘8 = {36, 356, 565, 718, 1049, 1054, 1314, 1377}, ๐’Ÿ140 ๐‘8 = ๐œ’140 โ‹ƒ ๐‘8. The maximum number of the intersection points between ๐œ’140 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’140 ๐‘8 is (25,10)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘8 is incomplete. The (25,10)-cap will be complete when you add 1062 points to it. Let ๐‘9 = {36, 356, 565, 718, 1049, 1054, 1314, 1377, 1756}. Put ๐’Ÿ140 ๐‘9 = ๐œ’140 โ‹ƒ ๐‘9. The maximum number of the intersection points between ๐œ’140 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’140 ๐‘9 is (26,11)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘9 is incomplete. The (26,11)-cap will be complete when you add 1340 points to it. Let ๐‘10 = {36, 356, 565, 718, 1049, 1054, 1314, 1377, 1756, 1818}, ๐’Ÿ140 ๐‘10 = ๐œ’140 โ‹ƒ ๐‘10. The maximum number of the intersection points between ๐œ’140 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’140 ๐‘10 is (27,12)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘10 is incomplete. The (27,12)-cap will be complete when you add 1383 points to it. Let ๐‘11 = {36, 356, 565, 718, 1049, 1054, 1314, 1377, 1756, 1818, 2253}. Put ๐’Ÿ140 ๐‘11 = ๐œ’140โ‹ƒ๐‘11. The maximum number of the intersection points between ๐œ’140 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’140 ๐‘11 is (28,13)-cap and ๐‘๐‘– values are ๐‘0 = 2351, ๐‘1 = 1. IHJPAS. 2024, 37( 3 ) 409 Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘11 is incomplete. The (28,13)-cap will be complete when you add 1625 points to it. Let ๐‘12 = {36, 356, 565, 718, 1049, 1054, 1314, 1377, 1756, 1818, 2253, 2331}. Put ๐’Ÿ140 ๐‘12= ๐œ’140โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’140 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’140 ๐‘12 is (29,14)-cap and ๐‘๐‘– values are ๐‘0 = 2351. Since ๐‘0 โ‰  0, then ๐œ’140 ๐‘12 is incomplete. The (29,14)-cap will be complete when you add 2351 points to it. 11. The line ๐ˆ(๐œ7, ๐œ9, 1,0,0,0) meets the cap ๐œ’238 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 24, 315, 453, 794, 860, 870, 968, 1324, 1534, 1658, 1895, 2373. Let ๐‘1 = {24}, ๐’Ÿ238 ๐‘1 = ๐œ’238โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’238 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’238 ๐‘1 is (11,3)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 11. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘1 is incomplete. The (11,3)-cap will be complete when you add 119 points to it. Let ๐‘2 = {24, 315}, ๐’Ÿ238 ๐‘2 = ๐œ’238โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’238 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’238 ๐‘2 is (12,4)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘2 is incomplete. The (12,4)-cap will be complete when you add 243 points to it. Let ๐‘3 = {24, 315, 453}, ๐’Ÿ238 ๐‘3 = ๐œ’238โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’238 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’238 ๐‘3 is (13,5)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘3 is incomplete. The (13,5)-cap will be complete when you add 393 points to it. Let ๐‘4 = {24, 315, 453, 794}, ๐’Ÿ238 ๐‘4 = ๐œ’238โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’238 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’238 ๐‘4 is (14,6)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘4 is incomplete. The (14,6)-cap will be complete when you add 509 points to it. Let ๐‘5 = {24, 315, 453, 794, 860}, ๐’Ÿ238 ๐‘5 = ๐œ’238โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’238 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’238 ๐‘5 is (15,7)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘5 is incomplete. The (15,7)-cap will be complete when you add 643 points to it. Let ๐‘6 = {24, 315, 453, 794, 860, 870}, ๐’Ÿ238 ๐‘6 = ๐œ’238 โ‹ƒ ๐‘6. The maximum number of the intersection points between ๐œ’238 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’238 ๐‘6 is (16,8)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘6 is incomplete. The (16,8)-cap will be complete when you add 707 points to it. Let ๐‘7 = {24, 315, 453, 794, 860, 870, 968}, ๐’Ÿ238 ๐‘7 = ๐œ’238โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’238 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’238 ๐‘7 is (17,9)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘7 is incomplete. The (17,9)-cap will be complete when you add 896 points to it. Let ๐‘8 = {24, 315, 453, 794, 860, 870, 968, 1324}, ๐’Ÿ238 ๐‘8 = ๐œ’238โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’238 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’238 ๐‘8 is (18,10)- cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘8 is incomplete. The (18,10)-cap will be complete when you add 1065 points to it. IHJPAS. 2024, 37( 3 ) 410 Let ๐‘9 = {24, 315, 453, 794, 860, 870, 968, 1324, 1534}, ๐’Ÿ238 ๐‘9 = ๐œ’238โ‹ƒ๐‘9. The maximum number of the intersection points between ๐œ’238 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’238 ๐‘9 is (19,11)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘9 is incomplete. The (19,11)-cap will be complete when you add 1406 points to it. Let ๐‘10 = {24, 315, 453, 794, 860, 870, 968, 1324, 1534, 1658}, ๐’Ÿ238 ๐‘10 = ๐œ’238 โ‹ƒ ๐‘10. The maximum number of the intersection points between ๐œ’238 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’238 ๐‘10 is (20,12)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘10 is incomplete. The (20,12)-cap will be complete when you add 1450 points to it. Let ๐‘11 = {24, 315, 453, 794, 860, 870, 968, 1324, 1534, 1658, 1895}, ๐’Ÿ238 ๐‘11 = ๐œ’238 โ‹ƒ ๐‘11. The maximum number of the intersection points between ๐œ’238 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’238 ๐‘11 is (21,13)-cap and ๐‘๐‘– values are ๐‘0 = 2358, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘11 is incomplete. The (21,13)-cap will be complete when you add 1629 points to it. Let ๐‘12 = {24, 315, 453, 794, 860, 870, 968, 1324, 1534, 1658, 1895, 2373}. Put ๐’Ÿ238 ๐‘12 = ๐œ’238โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’238 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’238 ๐‘12 is (22,14)-cap and ๐‘๐‘– values are ๐‘0 = 2358. Since ๐‘0 โ‰  0, then ๐œ’238 ๐‘12 is incomplete. The (22,14)-cap will be complete when you add 2358 points to it. 12. The line ๐ˆ(๐œ11, 1,0,0,0,0) meets the cap ๐œ’340 in 7 points, so we have seven extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 171, 511, 851, 1191, 1531, 1871, 2211. Let ๐‘1 = {171}, ๐’Ÿ340 ๐‘1 = ๐œ’340โ‹ƒ๐‘1. The maximum number of intersection points between ๐œ’340 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’340 ๐‘1 is (8,8)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’340 ๐‘1 is incomplete. The (8,8)-cap will be complete when you add 702 points to it. Let ๐‘2 = {171, 511}, ๐’Ÿ340 ๐‘2 = ๐œ’340โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’340 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’340 ๐‘2 is (9,9)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’340 ๐‘2 is incomplete. The (9,9)-cap will be complete when you add 912 points to it. Let ๐‘3 = {171, 511, 851}, ๐’Ÿ340 ๐‘3 = ๐œ’340 โ‹ƒ ๐‘3. The maximum number of the intersection points between ๐œ’340 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’340 ๐‘3 is (10,10)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’340 ๐‘3 is incomplete. The (10,10)-cap will be complete when you add 1077 points to it. Let ๐‘4 = {171, 511, 851, 1191}, ๐’Ÿ340 ๐‘4 = ๐œ’340โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’340 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’340 ๐‘4 is (11,11)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’340 ๐‘4 is incomplete. The (11,11)-cap will be complete when you add 1408 points to it. Let ๐‘5 = {171, 511, 851, 1191, 1531}, ๐’Ÿ340 ๐‘5 = ๐œ’340 โ‹ƒ ๐‘5. The maximum number of the intersection points between ๐œ’340 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’340 ๐‘5 is (12,12)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’340 ๐‘5 is incomplete. The (12,12)- cap will be complete when you add 1451 points to it. Let ๐‘6 = {171, 511, 851, 1191, 1531, 1871}, ๐’Ÿ340 ๐‘6 = ๐œ’340โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’340 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’340 ๐‘6 is (13,13)- IHJPAS. 2024, 37( 3 ) 411 cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’340 ๐‘6 is incomplete. The (13,13)-cap will be complete when you add 1635 points to it. Let ๐‘7 = {171, 511, 851, 1191, 1531, 1871, 2211}, ๐’Ÿ340 ๐‘7 = ๐œ’340 โ‹ƒ ๐‘7. The maximum number of the intersection points between ๐œ’340 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’340 ๐‘7 is (14,14)-cap and ๐‘๐‘– values are ๐‘0 = 2366. Since ๐‘0 โ‰  0, then ๐œ’340 ๐‘7 is incomplete. The (14,14)-cap will be complete when you add 2366 points to it. 13. The line ๐ˆ(๐œ, ๐œ6, 1,0,0,0) meets the cap ๐œ’476 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ , as in the following order: 205, 217, 220, 360, 574, 686, 809, 970, 971, 1139, 2233, 2321. Let ๐‘1 = {205}, ๐’Ÿ476 ๐‘1 = ๐œ’476โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’476 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’476 ๐‘1 is (6,3)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 11. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘1 is incomplete. The (6,3)-cap will be complete when you add 137 points to it. Let ๐‘2 = {205, 217}, ๐’Ÿ476 ๐‘2 = ๐œ’476โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’476 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’476 ๐‘2 is (7,4)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘2 is incomplete. The (7,4)-cap will be complete when you add 243 points to it. Let ๐‘3 = {205, 217, 220}, ๐’Ÿ476 ๐‘3 = ๐œ’476โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’476 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’476 ๐‘3 is (8,5)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘3 is incomplete. The (8,5)-cap will be complete when you add 399 points to it. Let ๐‘4 = {205, 217, 220, 360}, ๐’Ÿ476 ๐‘4 = ๐œ’476โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’476 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’476 ๐‘4 is (9,6)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘4 is incomplete. The (9,6)-cap will be complete when you add 509 points to it. Let ๐‘5 = {205, 217, 220, 360, 574}, ๐’Ÿ476 ๐‘5 = ๐œ’476โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’476 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’476 ๐‘5 is (10,7)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘5 is incomplete. The (10,7)-cap will be complete when you add 632 points to it. Let ๐‘6 = {205, 217, 220, 360, 574, 686}, ๐’Ÿ476 ๐‘6 = ๐œ’476 โ‹ƒ ๐‘6. The maximum number of the intersection points between ๐œ’476 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’476 ๐‘6 is (11,8)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘6 is incomplete. The (11,8)-cap will be complete when you add 677 points to it. Let ๐‘7 = {205, 217, 220, 360, 574, 686, 809}, ๐’Ÿ476 ๐‘7 = ๐œ’476โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’476 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’476 ๐‘7 is (12,9)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘7 is incomplete. The (12,9)-cap will be complete when you add 896 points to it. Let ๐‘8 = {205, 217, 220, 360, 574, 686, 809, 970}, ๐’Ÿ476 ๐‘8 = ๐œ’476โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’476 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) ten, so ๐œ’476 ๐‘8 is (13,10)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘8 is incomplete. The (13,10)-cap will be complete when you add 1069 points to it. IHJPAS. 2024, 37( 3 ) 412 Let ๐‘9 = {205, 217, 220, 360, 574, 686, 809, 970, 971}, ๐’Ÿ476 ๐‘9 = ๐œ’476โ‹ƒ๐‘9. The maximum number of the intersection points between ๐œ’476 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’476 ๐‘9 is (14,11)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘9 is incomplete. The (14,11)-cap will be complete when you add 1407 points to it. Let ๐‘10 = {205, 217, 220, 360, 574, 686, 809, 970, 971, 1139}, ๐’Ÿ476 ๐‘10 = ๐œ’476 โ‹ƒ ๐‘10. The maximum number of the intersection points between ๐œ’476 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’476 ๐‘10 is (15,12)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘10 is incomplete. The (15,12)-cap will be complete when you add 1389 points to it. Let ๐‘11 = {205, 217, 220, 360, 574, 686, 809, 970, 971, 1139, 2233}, ๐’Ÿ476 ๐‘11 = ๐œ’476โ‹ƒ ๐‘11. The maximum number of the intersection points between ๐œ’476 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’476 ๐‘11 is (16,13)-cap and ๐‘๐‘– values are ๐‘0 = 2363, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘11 is incomplete. The (16,13)-cap will be complete when you add 1630 points to it. Let ๐‘12 = {205, 217, 220, 360, 574, 686, 809, 970, 971, 1139, 2233, 2321}. Put ๐’Ÿ476 ๐‘12 = ๐œ’476โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’476 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’476 ๐‘12 is (17,14)-cap and ๐‘๐‘– values are ๐‘0 = 2363. Since ๐‘0 โ‰  0, then ๐œ’476 ๐‘12 is incomplete. The (17,14)-cap will be complete when you add 2363 points to it. 14. The line ๐ˆ(๐œ8, ๐œ2, 1,0,0,0) meets the cap ๐œ’595 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 108, 483, 501, 539, 1201, 1321, 1392, 1424, 1507, 1741, 1840, 2235. Let ๐‘1 = {108}, ๐’Ÿ595 ๐‘1 = ๐œ’595 โ‹ƒ ๐‘1. The maximum number of the intersection points between ๐œ’595 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’595 ๐‘1 is (5,3)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 11. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘1 is incomplete. The (5,3)-cap will be complete when you add 118 points to it. Let ๐‘2 = {108, 483}, ๐’Ÿ595 ๐‘2 = ๐œ’595โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’595 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’595 ๐‘2 is (6,4)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘2 is incomplete. The (6,4)-cap will be complete when you add 221 points to it. Let ๐‘3 = {108, 483, 501}, ๐’Ÿ595 ๐‘3 = ๐œ’595โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’595 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’595 ๐‘3 is (7,5)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘3 is incomplete. The (7,5)-cap will be complete when you add 404 points to it. Let ๐‘4 = {108, 483, 501, 539}, ๐’Ÿ595 ๐‘4 = ๐œ’595โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’595 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’595 ๐‘4 is (8,6)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘4 is incomplete. The (8,6)-cap will be complete when you add 491 points to it. Let ๐‘5 = {108, 483, 501, 539, 1201}, ๐’Ÿ595 ๐‘5 = ๐œ’595โ‹ƒ๐‘5. The maximum number of the intersection points between ๐œ’595 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’595 ๐‘5 is (9,7)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’595 108,483,501,539,1201 is incomplete. The (9,7)-cap will be complete when you add 633 points to it. Let ๐‘6 = {108, 483, 501, 539, 1201, 1321}, ๐’Ÿ595 ๐‘6 = ๐œ’595โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’595 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’595 ๐‘6 is (10,8)-cap and IHJPAS. 2024, 37( 3 ) 413 ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘6 is incomplete. The (10,8)-cap will be complete when you add 695 points to it. Let ๐‘7 = {108, 483, 501, 539, 1201, 1321, 1392}, ๐’Ÿ595 ๐‘7 = ๐œ’595โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’595 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’595 ๐‘7 is (11,9)- cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘7 is incomplete. The (11,9)- cap will be complete when you add 902 points to it. Let ๐‘8 = {108, 483, 501, 539, 1201, 1321, 1392, 1424}, ๐’Ÿ595 ๐‘8 = ๐œ’595โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’595 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’595 ๐‘8 is (12,10)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘8 is incomplete. The (12,10)-cap will be complete when you add 1073 points to it. Let ๐‘9 = {108, 483, 501, 539, 1201, 1321, 1392, 1424, 1507}, ๐’Ÿ595 ๐‘9 = ๐œ’595 โ‹ƒ ๐‘9. The maximum number of the intersection points between ๐œ’595 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’595 ๐‘9 is (13,11)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘9 is incomplete. The (13,11)-cap will be complete when you add 1346 points to it. Let ๐‘10 = { 108, 483, 501, 539, 1201, 1321, 1392, 1424, 1507, 1741}. Put ๐’Ÿ595 ๐‘10 = ๐œ’595โ‹ƒ๐‘10. The maximum number of the intersection points between ๐œ’595 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’595 ๐‘10 is (14,12)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘10 is incomplete. The (14,12)-cap will be complete when you add 1411 points to it. Let ๐‘11 = { 108, 483, 501, 539, 1201, 1321, 1392, 1424, 1507, 1741, 1840}. Put ๐’Ÿ595 ๐‘11= ๐œ’595โ‹ƒ๐‘11. The maximum number of the intersection points between ๐œ’595 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’595 ๐‘11 is (15,13)-cap and ๐‘๐‘– values are ๐‘0 = 2364, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘11 is incomplete. The (15,13)-cap will be complete when you add 1632 points to it. Let ๐‘12 = {108, 483, 501, 539, 1201, 1321, 1392, 1424, 1507, 1741, 1840, 2235}. Put ๐’Ÿ595 ๐‘12= ๐œ’595โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’595 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’595 ๐‘12 is (16,14)-cap and ๐‘๐‘– values are ๐‘0 = 2334. Since ๐‘0 โ‰  0, then ๐œ’595 ๐‘12 is incomplete. The (16,14)-cap will be complete when you add 2364 points to it. 15. The line ๐ˆ(๐œ11, 1,0,0,0,0) meets the cap ๐œ’1190 in 2 points, so we have twelve extension points that can be added to ๐œ’๐‘ƒ, as in the following order: 171, 341, 511, 681, 851, 1021, 1361, 1531, 1701, 1871, 2041, 2211. Let ๐‘1 = {171}, ๐’Ÿ1190 ๐‘1 = ๐œ’1190โ‹ƒ๐‘1. The maximum number of the intersection points between ๐œ’1190 ๐‘1 and the lines of ๐‘ƒ๐บ(3,13) are three, so ๐œ’1190 ๐‘1 is (3,3)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 11. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘1 is incomplete. The (3,3)-cap will be complete when you add 119 points to it. Let ๐‘2 = {171, 341}, ๐’Ÿ1190 ๐‘2 = ๐œ’1190โ‹ƒ๐‘2. The maximum number of the intersection points between ๐œ’1190 ๐‘2 and the lines of ๐‘ƒ๐บ(3,13) are four, so ๐œ’1190 ๐‘2 is (4,4)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 10. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘2 is incomplete. The (4,4)-cap will be complete when you add 222 points to it. Let ๐‘3 = {171, 341, 511}, ๐’Ÿ1190 ๐‘3 = ๐œ’1190โ‹ƒ๐‘3. The maximum number of the intersection points between ๐œ’1190 ๐‘3 and the lines of ๐‘ƒ๐บ(3,13) are five, so ๐œ’1190 ๐‘3 is (5,5)-cap and ๐‘๐‘– values are ๐‘0 = IHJPAS. 2024, 37( 3 ) 414 2366, ๐‘1 = 9. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘3 is incomplete. The (5,5)-cap will be complete when you add 401 points to it. Let ๐‘4 = {171, 341, 511, 681}, ๐’Ÿ1190 ๐‘4 = ๐œ’1190โ‹ƒ๐‘4. The maximum number of the intersection points between ๐œ’1190 ๐‘4 and the lines of ๐‘ƒ๐บ(3,13) are six, so ๐œ’1190 ๐‘4 is (6,6)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 8. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘4 is incomplete. The (6,6)-cap will be complete when you add 491 points to it. Let ๐‘5 = {171, 341, 511, 681, 851}, ๐’Ÿ1190 ๐‘5 = ๐œ’1190 โ‹ƒ ๐‘5. The maximum number of the intersection points between ๐œ’1190 ๐‘5 and the lines of ๐‘ƒ๐บ(3,13) are seven, so ๐œ’1190 ๐‘5 is (7,7)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 7. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘5 is incomplete. The (7,7)-cap will be complete when you add 603 points to it. Let ๐‘6 = {171, 341, 511, 681, 851, 1021}, ๐’Ÿ1190 ๐‘6 = ๐œ’1190โ‹ƒ๐‘6. The maximum number of the intersection points between ๐œ’1190 ๐‘6 and the lines of ๐‘ƒ๐บ(3,13) are eight, so ๐œ’1190 ๐‘6 is (8,8)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 6. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘6 is incomplete. The (8,8)-cap will be complete when you add 681 points to it. Let ๐‘7 = {171, 341, 511, 681, 851, 1021, 1361}, ๐’Ÿ1190 ๐‘7 = ๐œ’1190โ‹ƒ๐‘7. The maximum number of the intersection points between ๐œ’1190 ๐‘7 and the lines of ๐‘ƒ๐บ(3,13) are nine, so ๐œ’1190 ๐‘7 is (9,9)- cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 5. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘7 is incomplete. The (9,9)- cap will be complete when you add 899 points to it. Let ๐‘8 = {171, 341, 511, 681, 851, 1021, 1361, 1531}, ๐’Ÿ1190 ๐‘8 = ๐œ’1190โ‹ƒ๐‘8. The maximum number of the intersection points between ๐œ’1190 ๐‘8 and the lines of ๐‘ƒ๐บ(3,13) are ten, so ๐œ’1190 ๐‘8 is (10,10)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 4. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘8 is incomplete. The (10,10)-cap will be complete when you add 1069 points to it. Let ๐‘9 = { 171, 341, 511, 681, 851, 1021, 1361, 1531, 1701}, ๐’Ÿ1190 ๐‘9 = ๐œ’1190 โ‹ƒ ๐‘9. The maximum number of the intersection points between ๐œ’1190 ๐‘9 and the lines of ๐‘ƒ๐บ(3,13) are eleven, so ๐œ’1190 ๐‘9 is (11,11)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 3. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘9 is incomplete. The (11,11)-cap will be complete when you add 1347 points to it. Let ๐‘10 = {171, 341, 511, 681, 851, 1021, 1361, 1531, 1701, 1871}, ๐’Ÿ1190 ๐‘10 = ๐œ’1190โ‹ƒ๐‘10. The maximum number of the intersection points between ๐œ’1190 ๐‘10 and the lines of ๐‘ƒ๐บ(3,13) are twelve, so ๐œ’1190 ๐‘10 is (12,12)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 2. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘10 is incomplete. The (12,12)-cap will be complete when you add 1434 points to it. Let ๐‘11 = {171, 341, 511, 681, 851, 1021, 1361, 1531, 1701, 1871, 2041}, ๐’Ÿ1190 ๐‘11 = ๐œ’1190โ‹ƒ๐‘11. The maximum number of the intersection points between ๐œ’1190 ๐‘11 and the lines of ๐‘ƒ๐บ(3,13) are thirteen, so ๐œ’1190 ๐‘11 is (13,13)-cap and ๐‘๐‘– values are ๐‘0 = 2366, ๐‘1 = 1. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘11 is incomplete. The (13,13)-cap will be complete when you add 1635 points to it. Let ๐‘12 = {171, 341, 511, 681, 851, 1021, 1361, 1531, 1701, 1871, 2041, 2211}. Put ๐’Ÿ1190 ๐‘12 = ๐œ’1190โ‹ƒ๐‘12. The maximum number of the intersection points between ๐œ’1190 ๐‘12 and the lines of ๐‘ƒ๐บ(3,13) are fourteen, so ๐œ’1190 ๐‘12 is (14,14)-cap and ๐‘๐‘– values are ๐‘0 = 2366. Since ๐‘0 โ‰  0, then ๐œ’1190 ๐‘12 is incomplete. The (14,14)-cap will be complete when you add 2366 points to it. IHJPAS. 2024, 37( 3 ) 415 4. Results and discussions The order pairs (๐‘  + ๐‘–, ๐‘‘ + ๐‘–) refer to the size and degree of the new extension cap from (๐‘ , ๐‘‘)- cap, ๐’Ÿ๐‘ƒ ๐‘๐‘– . Let # denote the number of added points to the orbit to be complete. Table 1 contains a summary of the getting results. Table 1. Details about the extension complete caps. ๐’Ÿ๐‘ƒ ๐‘๐‘– (size, degree) of the cap # 1 ๐’Ÿ4 ๐‘๐‘– (595,7) โ†’ (595 + ๐‘–, 7 + ๐‘–), ๐‘– = 1, โ€ฆ ,7 196, 413, 600, 702, 1016, 1148, 1778 2 ๐’Ÿ7 ๐‘๐‘– (340,4) โ†’ (340 + ๐‘–, 4 + ๐‘–), ๐‘– = 1, โ€ฆ ,10 66, 196, 335, 463, 685, 816, 991, 1180, 1395, 2030 3 ๐’Ÿ14 ๐‘๐‘– (170,2) โ†’ (170 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 20, 119, 254, 352, 537, 629, 818, 970, 1200, 1325, 1516, 2198 4 ๐’Ÿ20 ๐‘๐‘– (119,7) โ†’ (119 + ๐‘–, 7 + ๐‘–), ๐‘– = 1, โ€ฆ ,7 658, 827, 1033, 1250, 1383, 1555, 2254 5 ๐’Ÿ28 ๐‘๐‘– (85,2) โ†’ (85 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 74, 176, 319, 433, 623, 671, 892, 1047, 1299, 1367, 1577, 2283 6 ๐’Ÿ35 ๐‘๐‘– (68,3) โ†’ (68 + ๐‘–, 3 + ๐‘–), ๐‘– = 1, โ€ฆ ,11 189, 334, 486, 627, 692, 876, 1037, 1312, 1401, 1591, 2301 7 ๐’Ÿ68 ๐‘๐‘– (35,7) โ†’ (35 + ๐‘–, 7 + ๐‘–), ๐‘– = 1, โ€ฆ ,7 709, 901, 1065, 1395, 1427, 1615, 2338 8 ๐’Ÿ70 ๐‘๐‘– (34,2) โ†’ (34 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 109, 226, 368, 468, 639, 697, 989, 1056, 1330, 1421, 1612, 2334 9 ๐’Ÿ119 ๐‘๐‘– (20,2) โ†’ (20 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 117, 241, 392, 507, 639, 734, 891, 1066, 1335, 1444, 1623, 2348 10 ๐’Ÿ140 ๐‘๐‘– (19,2) โ†’ (19 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 128, 248, 388, 489, 647, 707, 904, 1062, 1340, 1383, 1625, 2351 11 ๐’Ÿ238 ๐‘๐‘– (10,2) โ†’ (10 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 119, 243, 393, 509, 643, 707, 896, 1065, 1406, 1450, 1629, 2358 12 ๐’Ÿ340 ๐‘๐‘– (7,7) โ†’ (7 + ๐‘–, 7 + ๐‘–), ๐‘– = 1, โ€ฆ ,7 702, 912, 1077, 1408, 1451, 1635, 2366 13 ๐’Ÿ476 ๐‘๐‘– (5,2) โ†’ (5 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 137, 243, 399, 509, 632, 677, 896, 1069, 1407, 1389, 1630, 2363 14 ๐’Ÿ595 ๐‘๐‘– (4,2) โ†’ (4 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 118, 221, 404, 491, 633, 695, 902, 1073, 1346, 1411, 1632, 2364 15 ๐’Ÿ1190 ๐‘๐‘– (2,2) โ†’ (2 + ๐‘–, 2 + ๐‘–), ๐‘– = 1, โ€ฆ ,12 119, 222, 401, 491, 603, 681, 899, 1069, 1347, 1434, 1635, 2366 5. Conclusion Theory of Group action is very helpful to introduce new caps in the finite projective space of dimension higher than two. All caps that are founded in this paper can be used to construct linear codes. Also, all these caps can be used to construct more caps which will deal with it in the next paper. Acknowledgment The authors would like to thank the University of Mustansiriyah (https://uomustansiriyah.edu.iq/), Department of Mathematics in the College of Sciences for their motivation and support. IHJPAS. 2024, 37( 3 ) 416 Conflicts of Interest The authors declare no conflict of interest. Funding Non References 1. Hirschfeld, J.W.P. Finite projective spaces of three dimensions; New York: Ox-ford Mathematical Monographs, The Clarendon Press, Oxford University Press, 1985; ISBN 0198535368, 9780198535362. 2. Hirschfeld, J.W.P. Projective geometries over finite fields; 2nd edn., New York: Ox-ford Mathematical Monographs, The Clarendon Press, Oxford University Press, 1998, ISBN 0198502958, 9780198502951. 3. Kiss, G.; Szonyi, T. Finite Geometries, 1st ed., Chapman and Hall/CRC Press, 2020. 4. Segre, B. On complete caps and ovaloids in three-dimensional Galois spaces of characteristic two, Acta Arith. 1959, 5, 315-332,. DOI: https://doi.org/10.4064/aa-5-3-315-332. 5. Davydov, A. A.; Marcugini, S.; Pambianco, F. Complete caps in projective spaces ๐‘ƒ๐บ(๐‘›, ๐‘ž), J. Geom. 2004, 80, 23-30. DOI. https://doi.org/10.1007/s00022-004-1778-3. 6. Anbar, N.; Bartoli, D.; Giulietti, M.; Platoni, I. Small complete caps from nodal cubics, Preprint. 2013, 1305.3019.pdf (arxiv.org). 7. Davydov, A. A.; Faina, G.; Marcugini, S.; Pambianco, F. On the spectrum of sizes of complete caps in projective spaces ๐‘ƒ๐บ(๐‘›, ๐‘ž) of small dimension, Eleventh International Workshop on Algebrai and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria. 57-62. 8. Al-Rikabi, A. J. Construction of Some Types of Sets in Three-Dimensional Projective Space over Finite Field of Order Eight, Ph.D. Thesis, Mustansiriyah University, Baghdad, Iraq, 2022. 9. Radhi, J. Sh. Complete Arcs and Extension Complete Caps by Groups action on ๐‘ƒ๐บ(3,11). Ph.D. Thesis, Mustansiriyah University, Baghdad, Iraq, 2023. 10. Attook, S. M. Arcs and Caps of Various Degrees in the Finite Projective Space ๐‘ƒ๐บ(3,13). Ph.D. Thesis, Mustansiriyah University, Baghdad, Iraq, 2023. 11. Khalaf, A. M.; Yahya, N. Y. K. New Examples in Coding Theory for Construction Optimal Linear Codes Related with Weight Distribution, AIP Conference Proceedings. 2023. 2845(1), 050043. DOI: https://doi.org/10.1063/5.0170590. 12. Al-Zangana, E. B.; Shehab, E. A. Certain Types of Linear Codes Over the Finite Field of order Twenty- Five. Iraqi Journal of Science (IJS). 2021, 62(11), 4019-4031. DOI: https://doi.org/10.24996/ijs.2021.62.11.22. 13. Al-Zangana, E. B. Projective MDS Codes Over ๐บ๐น(27), Baghdad Sci. Journal. 2021, 18(2), (Suppl.), 1125-1132. DOI: https://doi.org/10.21123/bsj.2021.18.2(Suppl.).1125. 14. Nahya,N. Y. K.; Salim, M. N. The Geometric Approach to Existences Linear [๐‘›, ๐‘˜, ๐‘‘]13 Code, International Journal of Enhanced Research in science, Technology and Engineering. 2018 ISSN: 2319-7463. DOI: https:// doi.org/ 10.13140/RG.2.2.16018.96960 15. Davydov, A. A.; Marcugini, S.; Pambianco, F. On the Weight Distribution of the Costs of MDS Codes, Advances in Mathematics of Communications. 2023, 17(5), 1115-1138. DOI: https://doi.org/10.3934/amc.2021042. 16. Davydov, A. A.; Marcugini, S.; Pambianco, F. On Cosets Weight Distributions of the Doubly-Extended Reed-Solomon Codes of Codimension 4, IEEE Trans. Inform. Theory. 2021, 67(8), 5088-5096. DOI: https://doi.org/10.1109/TIT.2021.3089129. https://www.sciencegate.app/app/redirect#aHR0cHM6Ly9keC5kb2kub3JnLzEwLjQwNjQvYWEtNS0zLTMxNS0zMzI= https://doi.org/10.1007/s00022-004-1778-3 https://arxiv.org/pdf/1305.3019.pdf https://doi.org/10.1063/5.0170590 https://doi.org/10.24996/ijs.2021.62.11.22 https://doi.org/10.21123/bsj.2021.18.2(Suppl.).1125 https://doi.org/10.3934/amc.2021042 https://doi.org/10.1109/TIT.2021.3089129 IHJPAS. 2024, 37( 3 ) 417 17. Alderson, T. L. n-Dimensional Optical Orthogonal Codes, Bounds and Optimal Constructions, Springer-Verlag GmbH Germany, part of Springer Nature. 2019, 30(5), 373-386. DOI: https://doi.org/10.1007/s00200-018-00379-3. 18. Starodub, V.; Skuratovskii, R. V.; Podpriatov, S. S. Triangle Conics, Cubics and Possible Applications in Cryptography, Mathematics and Statistics. 2021, 9(5), 749-759. DOI: https://doi.org/10.13189/ms.2021.090515. 19. Skuratovskii, R.; Osadchyy, V. Criterions of Supersingularity and Groups of Montgomery and Edwards Curves in Cryptography, WSEAS Transactions on Mathematics. 2021, 19, 709-722. DOI: https://doi.org/10.37394/23206.2020.19.77. 20. Bruen, A.A.; Hirschfeld, J.W.P.; Wehlau, D.L. Cubic Curves, Finite Geometry and Cryptography, Acta Applicandae Mathematicae. 2011, 115, 265-278. DOI: https://doi.org/10.48550/arXiv.1107.4387. 21. Ali, F. H.; Jawad, R. N. Using Evolving Algorithms to Cryptanalysis Nonlinear Cryptosystems, Baghdad Science Journal. 2020, 17(2) (Special Issue), 682-688. DOI: http://dx.doi.org/10.21123/bsj.2020.17.2(SI).0682. 22. Ghazi, A. A.; Ali, F. H. Robust and Efficient Dynamic Stream Cipher Cryptosystem, Iraqi Journal of Science 2018, 59(2C), 1105-1114,. DOI: http://dx.doi.org/10.24996/ijs.2018.59.2C.15. 23. Alonso-Gonzรกlez, C.; Navarro-Pรฉrez, M. ร.; Soler-Escrivร , X. Flag Codes from Planar Spreads in Network Coding, Finite Fields and Their Applications. 2020, 73, 1-21. DOI: http://dx.doi.org/10.1016/J.FFA.2020.101745. 24. Greferath, M.; Pavcevic, M.; Silberstein, O. N.; Vazquez-Castro, M. A. edn. Network Coding and Subspace Designs. New York, NY, USA: Springer. 2018. 25. Aguglia, A.; Pavese, F. On Non-Singular Hermitian Varieties of ๐‘ƒ๐บ(4, ๐‘ž2), Discrete Mathematics, 2020, 343(1), 1-5. DOI: http://dx.doi.org/10.1016/j.disc.2019.111634. 26. Durante, N.; Grimaldi, G. G. Absolute Points of Correlations of ๐‘ƒ๐บ(4, ๐‘ž๐‘›), Journal of Algebraic Combinatorics, 2022, 56, 873-887. DOI: https://doi.org/10.1007/ s10801-022-01135-0. 27. Bartoli, D.; Durante, N. On the Classification of Low-Degree Ovoids of ๐‘„(4, ๐‘ž), Combinatorica, 2022, 42, suppl. (1), 953-969. DOI: https://doi.org/10.1007/s00493-022-5005-3. 28. Aguglia, F.; Pavese, F. On Non-Singular Hermitian Varieties of ๐‘ƒ๐บ(4, ๐‘ž2), Discrete Mathematics, 2020, 343(1), 111634,. DOI: https://doi.org/10.1016/j.disc.2019. 111634. 29. Durante, N.; Grimaldi, G. G. Absolute Points of Correlations of ๐‘ƒ๐บ(5, ๐‘ž๐‘›), Discrete Mathematics, 2023, 346(9), 1-14. DOI: https://doi.org/10.1016/j.disc.2023. 113485. 30. Aguglia, A.; Giuzzi, L.; Homma, M. On Hermitian Varieties in ๐‘ƒ๐บ(6, ๐‘ž2), Ars Mathematica Contemporanea , 2021, 21(1), 1-11. DOI: https://doi.org/10.26493/1855-3974.2358.3c9. 31. Barwick, S. G.; Ruled Quintic Surfaces in ๐‘ƒ๐บ(6, ๐‘ž), Innovations in Incidence Geometry, 2019, 17, 25- 41. DOI: https://doi.org/10.2140/iig.2019.17.25. 32. The GAP Group, GAP. Reference manual. Version 4.11.1 released on 02 March 2022. Available online: https://www.gap-system.org/. https://arxiv.org/search/math?searchtype=author&query=Bruen,+A https://arxiv.org/search/math?searchtype=author&query=Hirschfeld,+J https://arxiv.org/search/math?searchtype=author&query=Wehlau,+D https://doi.org/10.48550/arXiv.1107.4387 http://dx.doi.org/10.21123/bsj.2020.17.2(SI).0682 https://doi.org/10.1007/%20s10801-022-01135-0 https://doi.org/10.1016/j.disc.2019.%20111634 https://doi.org/10.1016/j.disc.2023.%20113485