Generalizing blocking semiovals in finite projective planes
Abstract
Blocking semiovals and the determination of their (minimum) sizes constitute one of the central research topics in finite projective geometry. In this article we introduce the concept of blocking set with the r∞-property in a finite projective plane PG(2,q), with r∞ a line of PG(2,q) and q a prime power. This notion greatly generalizes that of blocking semioval. We address the question of determining those integers k for which there exists a blocking set of size k with the r∞-property. To solve this problem, we build new theory which deeply analyzes the interplay between blocking sets in finite projective and affine planes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.