Small 3-fold Blocking Sets in PG(2,p^n)
Published:Dec 31, 2025 07:48
•1 min read
•ArXiv
Analysis
This paper addresses the open problem of constructing small t-fold blocking sets in the finite Desarguesian plane PG(2,p^n), specifically focusing on the case of 3-fold blocking sets. The construction of such sets is important for understanding the structure of finite projective planes and has implications for related combinatorial problems. The paper's contribution lies in providing a construction that achieves the conjectured minimum size for 3-fold blocking sets when n is odd, a previously unsolved problem.
Key Takeaways
Reference
“The paper constructs 3-fold blocking sets of conjectured size, obtained as the disjoint union of three linear blocking sets of Rédei type, and they lie on the same orbit of the projectivity (x:y:z)↦(z:x:y).”