COMPLETE (k,3)-ARCS CONTAINING COMPLETE QUADRANGLE VERTICES IN PG(2,4): STRUCTURAL ANALYSIS BASED ON DIAGONAL POINT INCLUSION.

Saved in:

Bibliographic Details
Title:	COMPLETE (k,3)-ARCS CONTAINING COMPLETE QUADRANGLE VERTICES IN PG(2,4): STRUCTURAL ANALYSIS BASED ON DIAGONAL POINT INCLUSION.
Authors:	ALTINTAŞ KAHRİMAN, Elif¹ ealtintaskahriman@bartin.edu.tr, BAYAR, Ayşe² akorkmaz@ogu.edu.tr
Source:	Eskişehir Technical University Journal of Science & Technology A - Applied Sciences & Engineering. 2025, Vol. 26 Issue 4, p478-485. 8p.
Subjects:	Projective planes, Combinatorial designs & configurations, Quadrilaterals, Geometrical constructions, Finite fields, Algorithms
Abstract:	In this study, complete (k, 3) -arcs in the projective plane PG(2,4) that include all vertices of a complete quadrangle are systematically analyzed with respect to the inclusion of diagonal points. A computational algorithm developed in C# was employed to construct and classify such arcs. The results show that the complete quadrangle itself forms a complete (7, 3) -arcs, and exactly 7560 such arcs exist depending on the choice of quadrangle point sets. Furthermore, three distinct types of complete (9, 3) -arcs were identified: 24 arcs containing all four vertices and two diagonals, 48 arcs containing all four vertices and one diagonal point, and 480 arcs with all four vertices and no diagonal points. These findings reveal the combinatorial diversity of arc configurations in finite projective planes and provide new contributions to the classification of arcs. The methodology also demonstrates the effectiveness of algorithmic approaches in investigating geometric structures over finite fields. [ABSTRACT FROM AUTHOR]
	Copyright of Eskişehir Technical University Journal of Science & Technology A - Applied Sciences & Engineering is the property of Eskisehir Technical University Rector's Office and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In this study, complete (k, 3) -arcs in the projective plane PG(2,4) that include all vertices of a complete quadrangle are systematically analyzed with respect to the inclusion of diagonal points. A computational algorithm developed in C# was employed to construct and classify such arcs. The results show that the complete quadrangle itself forms a complete (7, 3) -arcs, and exactly 7560 such arcs exist depending on the choice of quadrangle point sets. Furthermore, three distinct types of complete (9, 3) -arcs were identified: 24 arcs containing all four vertices and two diagonals, 48 arcs containing all four vertices and one diagonal point, and 480 arcs with all four vertices and no diagonal points. These findings reveal the combinatorial diversity of arc configurations in finite projective planes and provide new contributions to the classification of arcs. The methodology also demonstrates the effectiveness of algorithmic approaches in investigating geometric structures over finite fields. [ABSTRACT FROM AUTHOR]
ISSN:	26674211
DOI:	10.18038/estubtda.1754684