Classification of Minimal Blocking Sets in PG(2,11) With a Nontrivial Automorphism Group

ABSTRACT We obtain, by computer, a full classification up to equivalence of all minimal blocking sets with a nontrivial automorphism group in the Desarguesian projective plane of order 11. We list the resulting numbers of sets according to their size and the order of their automorphism group. For the minimal blocking sets with the larger automorphism groups, explicit descriptions are given. We also give a list of all blocking semiovals among the results. In contrast to similar work on the planes of smaller order, only those blocking sets were generated that have an automorphism group of size , as the number of minimal blocking sets with a trivial group is estimated to be infeasibly large. New algorithms had to be devised to obtain these results because simply generating all sets and filtering out those with a nontrivial automorphism group was totally impractical.