Abstract
Letq be an odd prime power not divisible by 3. In Part I of this series, it was shown that the number of points in a rank-n combinatorial geometry (or simple matroid) representable over GF(3) and GF(q) is at mostn 2. In this paper, we show that, with the exception ofn = 3, a rank-n geometry that is representable over GF(3) and GF(q) and contains exactlyn 2 points is isomorphic to the rank-n Dowling geometry based on the multiplicative group of GF(3).
Similar content being viewed by others
References
Dowling, T.A.: Aq-analog of the partition lattice. In: A Survey of Combinatorial Theory (J.N. Srivastava, ed.), pp. 101–115. Amsterdam: North-Holland 1973
Dowling, T.A.: A class of geometric lattices based on finite groups. J. Comb. Theory (B)14, 61–86 (1973)
Heller, I.: On linear systems with integral valued solutions. Pacific J. Math.7, 1351–1354 (1957)
Kantor, W.M.: Dimension and embedding theorems for geometric lattices. J. Comb. Theory (A)17, 173–95 (1974)
Kung, J.P.S.: Combinatorial geometries representable over GF(3) and GF(q). I. The number of points. Discrete and Computational Geometry (to appear)
Seymour, P.D.: Matroid representation over GF(3). J. Comb. Theory (B)26, 159–173 (1979)
Seymour, P.D.: Decomposition of regular matroids. J. Comb. Theory (B)28, 305–359 (1980)
Tutte, W.T.: A homotopy theorem for matroids, II. Trans. Amer. Math. Soc.88, 161–174 (1958)
Welsh, D.J.A.: Matroid theory. London: Academic Press 1976
White, N.L. (ed.): Theory of matroids. Cambridge: Cambridge University Press 1986
Zaslavsky, T.: Signed graphs. Discrete Appl. Math.4, 47–74 (1982): erratum, ibid.5, 248 (1983)
Author information
Authors and Affiliations
Additional information
This research was partially supported by the National Science Foundation under Grants DMS-8521826 and DMS-8500494.
Rights and permissions
About this article
Cite this article
Kung, J.P.S., Oxley, J.G. Combinatorial geometries representable over GF(3) and GF(q). II. Dowling geometries. Graphs and Combinatorics 4, 323–332 (1988). https://doi.org/10.1007/BF01864171
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01864171