It is shown that the maximum size of a set S of vectors of a k-dimensional vector space over F q , with the property that every subset of size k is a basis, is at most q + 1 if k ≤ p, and at most q + k − p if q ≥ k ≥ p + 1 ≥ 4, where q = p h and p is prime. Moreover, for k ≤ p, the sets S of maximum size are classified, generalising Beniamino Segre's "arc is a conic" theorem.These results have various implications. One such implication is that a k × (p + 2) matrix, with k ≤ p and entries from F p , has k columns which are linearly dependent. Another is that the uniform matroid of rank r that has a base set of size n ≥ r + 2 is representable over F p if and only if n ≤ p + 1. It also implies that the main conjecture for maximum distance separable codes is true for prime fields; that there are no maximum distance separable linear codes over F p , of dimension at most p, longer than the longest Reed-Solomon codes. The classification implies that the longest maximum distance separable linear codes, whose dimension is bounded above by the characteristic of the field, are Reed-Solomon codes.In the autumn of 2008 while I was visiting Budapest, together with Andras Gács, we formulated the coordinate free version of Segre's lemma of tangents (Lemma 2.1) which is fundamental to this article. I dedicate this work to Andras, whose humour, enthusiasm and brilliance I am grateful to have known.

No abstract

Given a set U of size q in an affine plane of order q, we determine the possibilities for the number of directions of secants of U, and in many cases characterize the sets U with given number of secant directions. Academic Press

We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces.

The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.