Combinatorial geometries representable over GF(3) and GF(q). I: The number of points (Q911051): Difference between revisions

The author gives an elementary proof of the following Theorem. Let G be a ternary geometry of rank n which is representable over a field of characteristic p, where p is not equal to 3. Then the number of points in G is at most \(n^ 2.\) He shows moreover that the number of points in a ternary geometry of rank n not containing the Reid geometry is at most \(n^ 2\); this bound is sharp and is attained by the ternary Dowling geometries.