On bisecants of R\'edei type blocking sets and applications
Bence Csajb\'ok

TL;DR
This paper employs polynomial techniques to analyze Re9dei type blocking sets, deriving structural results, improving bounds on odd-secants, and classifying semiovals, with applications to finite projective planes and related combinatorial structures.
Contribution
It introduces new structural insights on Re9dei type blocking sets and semiovals, improving bounds and classifying configurations in finite projective planes.
Findings
Improved lower bound on the number of odd-secants of a (q+2)-set in PG(2,q)
Proved non-existence of semiovals of size q+3 when 3 does not divide q and q>5
Extended classification results of semiovals of size q+2 and q+3
Abstract
We use polynomial techniques to derive structural results on R\'edei type blocking sets from information on their bisecants. We apply our results to point sets of with few odd-secants. In particular, we improve the lower bound of Balister, Bollob\'as, F\"uredi and Thompson on the number of odd-secants of a -set in and we answer a related open question of Vandendriessche. We prove structural results for semiovals and derive the non existence of semiovals of size when 3 does not divide and . This extends a result of Blokhuis who classified semiovals of size , and a result of Bartoli who classified semiovals of size when . In the even case we can say more applying a result of Sz\H{o}nyi and Weiner about the stability of sets of even type. We also obtain new proof to a result of G\'acs and Weiner about -arcs of type…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
