Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
From MaRDI portal
Publication:911051
DOI10.1007/BF02187781zbMath0697.51007OpenAlexW2094610860MaRDI QIDQ911051
Publication date: 1990
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131108
Combinatorial aspects of finite geometries (05B25) Other finite incidence structures (geometric aspects) (51E30)
Related Items
On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants, The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics, Automorphisms of Dowling Lattices and Related Geometries, On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices, Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries, On Matroids Representable over 𝐺𝐹(3) and Other Fields, Reconstructing ternary Dowling geometries, Forbidden configurations, discrepancy and determinants, On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids, The highly connected matroids in minor-closed classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The regular matroids with no 5-wheel minor
- On linear systems with integral valued solutions
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries
- Algebraic characteristic sets of matroids
- Matroid representation over GF(3)
- Signed graphs
- A class of geometric lattices based on finite groups
- Wave propagation in a micropolar elastic half-space
- Note on Independence Functions
- THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING M(K4) AND THE (q + 2)-POINT LINE AS MINORS
- Computational complexity of parametric linear programming
- A Note on Tutte's Unimodular Representation Theorem
- Higher Order Independence in Matroids
- Theory of Matroids