Abstract
We construct new -arcs in PG by prescribing a group of automorphisms and solving the resulting Diophantine linear system with lattice point enumeration. We can improve the known lower bounds for and give the first example of a double blocking set of size in PG with and prime.
Citation
Michael Braun. Axel Kohnert. Alfred Wassermann. "Construction of $(n,r)$-arcs in $\mathrm{PG}(2,q)$." Innov. Incidence Geom. 1 133 - 141, 2005. https://doi.org/10.2140/iig.2005.1.133
Information