Unitals in Projective Planes

This book is a monograph on unitals embedded in ?nite projective planes. Unitals are an interesting structure found in square order projective planes, and numerous research articles constructing and discussing these structures have appeared in print. More importantly, there still are many open pr- lems, and this remains a fruitful area for Ph.D. dissertations. Unitals play an important role in ?nite geometry as well as in related areas of mathematics. For example, unitals play a parallel role to Baer s- planes when considering extreme values for the size of a blocking set in a square order projective plane (see Section 2.3). Moreover, unitals meet the upper bound for the number of absolute points of any polarity in a square order projective plane (see Section 1.5). From an applications point of view, the linear codes arising from unitals have excellent technical properties (see 2 Section 6.4). The automorphism group of the classical unitalH =H(2,q ) is 2-transitive on the points ofH, and so unitals are of interest in group theory. In the ?eld of algebraic geometry over ?nite ?elds,H is a maximal curve that contains the largest number of F -rational points with respect to its genus, 2 q as established by the Hasse-Weil bound.

This clearly written text is the first book on unitals embedded in finite projective planes. Unitals are key structures in square order projective planes, and have connections with other structures in algebra. They provide a link between groups and geometries. There is a considerable number of research articles concerning unitals, and there also exist many open problems. This book is a thorough survey of the research literature on embedded unitals which collects this material in book form for the first time. The book is aimed at graduate students and researchers who want to learn about this topic without reading all the original articles.

 

The primary proof techniques used involve linear algebraic arguments, finite field arithmetic, some elementary number theory, and combinatorial enumeration. Some computer results not previously found in the literature also are mentioned in the text. The authors have included a comprehensive bibliography which will become an invaluable resource.

 

Gary Ebert is Professor of Mathematics at the University of Delaware, USA. Susan Barwick is a Senior Lecturer of Mathematics at the University of Adelaide, Australia.