Skip to main content
Log in

On completely reducible solvable subgroups of GL(n, Δ)

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

Let Δ be a finite field and denote by GL(n, Δ) the group ofn×n nonsingular matrices defined over Δ. LetR⊆GL(n, Δ) be a solvable, completely reducible subgroup of maximal order. For |Δ|≧2, |Δ|≠3 we give bounds for |R| which improve previous ones. Moreover for |Δ|=3 or |Δ|>13 we determine the structure ofR, in particular we show thatR is unique, up to conjugacy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. D. Dixon,The Fitting subgroup of a linear solvable group, J. Aust. Math. Soc.7 (1967), 417–424.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Mann, private communication.

  3. Y. Segev, Ph.D. Thesis, The Hebrew University of Jerusalem, 1984.

  4. D. A. Suprunenko,Matrix Groups, Translations of Mathematical Monographs, Vol. 45, 1976.

  5. T. R. Wolf,Solvable and nilpotent subgroup of GL (n, q m), Can. J. Math.5 (1982), 1097–1111.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work is part of a Ph.D. thesis done at the Hebrew University under the supervision of Professor A. Mann.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Segev, Y. On completely reducible solvable subgroups of GL(n, Δ). Israel J. Math. 51, 163–176 (1985). https://doi.org/10.1007/BF02772964

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02772964

Keywords

Navigation