Skip to main content
Log in

Theorems like Wielandt's

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

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.

Institutional subscriptions

References

  1. A. R. Camina, Transitivity criteria for finite permutation groups. Comm. Algebra9, 1693–1700 (1981).

    Google Scholar 

  2. A. Camina andJ. Siemons, Block transitive automorphism groups of 2 — (v, k, 1) block designs. J. Combin. Theory Ser. A51, 268–276 (1989).

    Google Scholar 

  3. P.Dembowski, Finite Geometries. Berlin-Heidelberg-New York 1968.

  4. J. Doyen, Designs and automorphism groups. In: Surveys in Combinatorics, London Math. Soc. Lecture Note Ser.141, 75–83, Cambridge 1989.

    Google Scholar 

  5. W. Feit andJ. G. Thompson, Solvability of groups of odd order. Pacific J. Math.13, 775–1029 (1963).

    Google Scholar 

  6. D.Gorenstein, Finite Groups. New York 1968.

  7. J. P. J. McDermott, Transitive permutation groups with 2-point stabilisers of order 2. Math. Z.157, 37–41 (1977).

    Google Scholar 

  8. M. O'Nan, A characterization ofL n (q) as a permutation group. Math. Z.127, 301–314 (1972).

    Google Scholar 

  9. H.Wielandt, Finite Permutation Groups. New York 1964.

  10. P.-H. Zieschang, Fahnentransitive Automorphismengruppen von Blockplänen. Geom. Dedicata18, 173–180 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zieschang, P.H. Theorems like Wielandt's. Arch. Math 58, 209–213 (1992). https://doi.org/10.1007/BF01292918

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Navigation