Skip to main content
Log in

Permutation groups on unordered sets

  • Published:
Mathematische Zeitschrift 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.

References

  1. Beaumont, R. A., Peterson, R. P.: Set-transitive permutation groups. Canadian J. Math.7, 35–42 (1955).

    Google Scholar 

  2. Livingstone, D., Wagner, A.: Transitivity of finite permutation groups on unordered sets. Math. Z.90, 393–403 (1965).

    Google Scholar 

  3. Ramsey, F. P.: On a problem of formal logic. Proc. London Math. Soc.30, 264–286 (1930).

    Google Scholar 

  4. Robinson, G. de B.: Note on a theorem of Livingstone and Wagner. Math. Z.102, 351–352 (1967).

    Google Scholar 

  5. Wielandt, H.: Endlichek-homogene Permutationsgruppen. Math. Z.101, 142 (1967).

    Google Scholar 

  6. —: Unendliche Permutationsgruppen. Lecture notes. 2nd ed. York University, Toronto (1967).

    Google Scholar 

  7. —: Permutation groups through invariant relations and invariant functions. Lecture notes, 101 pp. Dept. of Math., Ohio State University, Columbus, Ohio (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bercov, R.D., Hobby, C.R. Permutation groups on unordered sets. Math Z 115, 165–168 (1970). https://doi.org/10.1007/BF01109854

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation