Vol. 53, No. 1, 1974

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 304: 1  2
Vol. 303: 1  2
Vol. 302: 1  2
Vol. 301: 1  2
Vol. 300: 1  2
Vol. 299: 1  2
Vol. 298: 1  2
Vol. 297: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Editorial Board
Subscriptions
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
ISSN: 1945-5844 (e-only)
ISSN: 0030-8730 (print)
Author Index
To Appear
 
Other MSP Journals
Blocking sets and complete k-arcs

Aiden A. Bruen and J. C. Fisher

Vol. 53 (1974), No. 1, 73–84
Abstract

Let π be a finite projective plane of order n. Recall that a blooking set lS in π is a set of points which does not contain any line but which does intersect every line of π. The first objective is to elaborate on the connection, pointed out by the writers, between blocking sets and complete k-arcs of π. For example, the set of secants of a complete k-arc with k < n + 2 dualizes to a blocking set. Using some simple observations, it is shown that a blocking set in a projective plane π of order ten, if π exists, contains at least 16 points. The proof uses a computer result on the nonexistence of complete 6-arcs of π due to R. H. F. Denniston. Using the result, a recent theorem concerning certain codes related to π due to MacWilliams, Sloane, and Thompson is easily established. The result also shows that, in effect, a set of four mutually orthogonal latin squares of order ten is embeddable in a complete set in at most one way. This improves slightly on the bound of R. H. Bruck.

Mathematical Subject Classification 2000
Primary: 05B25
Milestones
Received: 3 July 1973
Published: 1 July 1974
Authors
Aiden A. Bruen
J. C. Fisher