Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
From MaRDI portal
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.
Recommendations
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries
- The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
- scientific article; zbMATH DE number 1182844
- Reconstructing ternary Dowling geometries
- Characterizing combinatorial geometries by numerical invariants
Cites work
- A class of geometric lattices based on finite groups
- A Note on Tutte's Unimodular Representation Theorem
- Algebraic characteristic sets of matroids
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries
- Computational complexity of parametric linear programming
- Higher Order Independence in Matroids
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3575600 (Why is no real title available?)
- scientific article; zbMATH DE number 3608715 (Why is no real title available?)
- scientific article; zbMATH DE number 3351601 (Why is no real title available?)
- Matroid representation over GF(3)
- Note on Independence Functions
- On linear systems with integral valued solutions
- Signed graphs
- THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING M(K4) AND THE (q + 2)-POINT LINE AS MINORS
- The regular matroids with no 5-wheel minor
- Theory of Matroids
- Wave propagation in a micropolar elastic half-space
Cited in
(13)- The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
- Reconstructing ternary Dowling geometries
- Forbidden configurations, discrepancy and determinants
- The highly connected matroids in minor-closed classes
- On the number of distinct rows of a matrix with bounded subdeterminants
- On P-polynomial representations of projective geometries in algebraic combinatorial geometries.
- Automorphisms of Dowling Lattices and Related Geometries
- On the highly connected dyadic, near-regular, and sixth-root-of-unity matroids
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
- On the Column Number and Forbidden Submatrices for -Modular Matrices
- Computing excluded minors for classes of matroids representable over partial fields
- Excluding a line from complex-representable matroids
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries
This page was built for publication: Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911051)