Abstract
Denote by PG(2,q) the finite desarguesian projective plane of order q, where q=ph, p a prime, q>2. We define the function m(q) as follows: m(q)=√q, if q is a square; m(q)=(q+1)/2, if q is a prime; m(q)=ph−d, if q=ph with h an odd integer, where d denotes the greatest divisor of h different from h. The following theorem is proved: For any integer k with q+m(q)+1 ⩽ k ⩽ q2−m(q), there exists a blocking set in PG(2,q) having exactly k elements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
