Semiarcs with long secants
Combinatorics
2013-10-29 v1
Abstract
In a projective plane of order , a non-empty point set is a -semiarc if the number of tangent lines to at each of its points is . If is a -semiarc in , , then each line intersects in at most points. Dover proved that semiovals (semiarcs with ) containing collinear points exist in only if . We show that if , then -semiarcs with collinear points exist only if . In we prove the lower bound , with equality only if is a blocking set of R\'edei type of size . We call the symmetric difference of two lines, with further points removed from each line, a -configuration. We give conditions ensuring a -semiarc to contain a -configuration and give the complete characterization of such -semiarcs in .
Cite
@article{arxiv.1310.7204,
title = {Semiarcs with long secants},
author = {Bence Csajbók},
journal= {arXiv preprint arXiv:1310.7204},
year = {2013}
}
Comments
12 pages