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

From MaRDI portal
Revision as of 10:40, 17 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q579622)
scientific article
Language Label Description Also known as
English
Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
scientific article

    Statements

    Combinatorial geometries representable over GF(3) and GF(q). I: The number of points (English)
    0 references
    0 references
    1990
    0 references
    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.
    0 references
    ternary geometry
    0 references

    Identifiers