The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

In this paper, results of a non-exhaustive computer search for unitals in the known planes of
order twenty-five are reported. The 2-(126, 6, 1) designs associated with newly found unitals …

We describe a very versatile, fast and useful open source software package to compute
combinatorial objects up to isomorphism called Orbiter. We provide an overview of some of …

We give a general construction for unitals of order q admitting an action of SU (2, q). The
construction covers the classical Hermitian unitals, Grüning's unitals in Hall planes and at …

In this study, we perform computer searches for unitals in planes of order 16. The number of
known nonisomorphic unitals in these planes is improved to be 261. Some data related to 2 …

A unital, that is, a block-design 2−(q 3+ 1, q+ 1, 1), is embedded in a projective plane Π of
order q 2 if its points and blocks are points and lines of Π. A unital embedded in PG (2, q 2) …

Orbiter is a software package to classify discrete objects such as designs, graphs, codes,
and objects from finite geometry. It employs the method of breaking the symmetry to attack …

Abstract A unital 2-(28, 4, 1) design has 28 points, each block has size 4 and every pair of
points is on exactly one block. A blocking set in a design is a subset of the point set with the …

A unital, that is a 2-(q^ 3+ 1, q+ 1, 1) block-design, is embedded in a projective plane π of
order q^ 2 if its points are points of π and its blocks are subsets of lines of π, the point-block …

The concept of full points of abstract unitals has been introduced by Korchmáros, Siciliano
and Szőnyi as a tool for the study of projective embeddings of abstract unitals. In this paper …