Incomplete (rq-q+r- ɛ , r)-arcs and minimal {ℓ,t}-Blocking set in PG(2,q)

Section: Research Paper
Published
Jun 25, 2025
Pages
43-60

Abstract

We proved that(rq-q+r-,r)-arcs is incomplete by using minimal {,t}-Blocking set in projective plane PG(2,q)and we found a new condition for is -A(r-1)2+B(r-1)-C and A,B,C is a constant which is not get previously in studies which is search in finding for incomplete (rq-q+r-,r)-arcs ,for value 2r 4 where q is prime for values 11q 31 in addition to q=16.

Identifiers

Download this PDF file

Statistics

How to Cite

Yassen Kasm Yahya, N., ندى, suhil najem, H., & هبة. (2025). Incomplete (rq-q+r- ɛ , r)-arcs and minimal {ℓ,t}-Blocking set in PG(2,q). AL-Rafidain Journal of Computer Sciences and Mathematics, 11(1), 43–60. Retrieved from https://rjps.uomosul.edu.iq/index.php/csmj/article/view/19389