Volume 3 • Issue 2 • PP: 01–06 • 2024
Finding the Complete List of Different K-Brackets for the Projective Plane PG (2,8)
Open Access & Copyright
© 2024 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
View PDF Abstract
A k-arc in a plane PG(2,q) is a set of k points such that every line in the plane intersects it in at most two points and there is a line intersecting it in exactly two points. A k-arc is complete if there is no (k + 1)-arc containing it. This study is concerned with k-arcs, k = 4,5,...,10, and with the classification of projectively distinct k-arcs and distinct arcs under collineation. Using a computer program, we prove that complete k-arcs occur only for k = 6 and k = 10.
Keywords
References
[1] S. M. Aziz, “On lower bound for complete (k,n)-arc in PG(2,q),” M.Sc. thesis, University of Mosul, 2001.
[2] J. M. Chao and H. Kaneta, “Classical arcs in PG(r,q) for 23 ≤ q ≤ 29,” Discrete Mathematics, vol. 226, pp. 377–385, 2001.
[3] K. Coolsaet and H. Sticker, “A full classification of complete k-arcs in PG(2,23) and PG(2,25),” Journal of Combinatorial Designs, n.d.
[4] K. Coolsaet and H. Sticker, “A full classification of complete k-arcs in PG(2,27),” 2009.
[5] F. A. Hasan, “On some complete arcs and algebraic curves,” M.Sc. thesis, University of Mosul, 2004.
[6] J. W. P. Hirschfeld, Projective Geometries over Finite Fields. Oxford: Oxford University Press, 1979.
[7] J. W. P. Hirschfeld and L. Storme, “The packing prob-lem in statistics, coding theory and finite projective spaces: Update 2001,” 2001, submitted.
[8] A. D. Thomas and G. V. Wood, Group Tables. Shiva Publishing Ltd., 1980.
[9] A. L. Yasin, “Cubic arcs in the projective plane of order eight,” Ph.D. dissertation, University of Sussex, 1986.
[10] H. Younis, “Classification of k-arcs in the projective plane PG(2,16),” M.Sc. thesis, University of Mosul, 1989.
Cite This Article
Choose your preferred format
Publisher's Note
The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.