×

Homogeneity in infinite permutation groups. (English) Zbl 0569.20004

If G is a permutation group on a set X, then G is said to be k- homogeneous (respectively k-transitive) if it is transitive on the set of unordered (respectively ordered) k-subsets of X. It is shown that if X is infinite, \(k\geq 5\), and G is (k-1)-transitive but not k-transitive, then the following hold: (i) G is not \((k+r)\)-homogeneous for any \(r\geq 3\); (ii) if G is \((k+2)\)-homogeneous, then the group induced by G on any k- subset of X is the alternating group \(A_ k\). This improves an earlier bound due to Hodges. The proof uses well-known upper bounds on the orders of finite primitive permutation groups which are derived from the classification of the finite simple groups.

MSC:

20B22 Multiply transitive infinite groups
20B07 General theory for infinite permutation groups
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] P. J. Cameron, Transitivity of permutation groups on unordered sets,Math. Z. 148 (1976), 127–139.MR 53: 5711 · Zbl 0318.20029
[2] P. J. Cameron, Finite permutation groups and finite simple groups,Bull. London Math. Soc. 13 (1981), 1–22.MR 83m: 20008 · Zbl 0463.20003
[3] P. J. Cameron, Orbits of permutation groups on unordered sets, IV: Homogeneity and transitivity,J. London Math. Soc. (2)27 (1983), 238–247.MR 84f: 20007b · Zbl 0519.20004
[4] G. Higman, Homogeneous relations,Quart. J. Math. (Oxford) (2)28 (1977), 31–39.MR 55: 3090 · Zbl 0349.20017
[5] W. A. Hodges,Model theory. (To appear)
[6] W. A. Hodges, A. H. Lachlan andS. Shelah, Possible orderings of an indiscernible sequence,Bull. London Math. Soc. 9 (1977), 212–215.MR 57: 16085 · Zbl 0361.20006
[7] W. M. Kantor, Permutation representations of the finite classical groups of small degree or rank,J. Algebra 60 (1979), 158–168.MR 80m: 20038 · Zbl 0422.20033
[8] W. M. Kantor, Some consequences of the classification of finite simple groups,Proceedings Montreal Conference (edited byJ. McKay). (To appear) · Zbl 0594.20008
[9] D. Livingstone andA. Wagner, Transitivity of finite permutation groups on unordered sets,Math. Z. 90 (1965), 393–403.MR 32: 4183 · Zbl 0136.28101
[10] C. C. Sims, Computational methods in the study of permutation groups,Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), Pergamon, London, 1970; 169–183.MR 41: 1856 · Zbl 0215.10002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.