Set-Transitive Permutation Groups

R. A. Beaumont; R. P. Peterson

doi:10.4153/CJM-1955-005-x

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The concept of an s-ply transitive (1 ≤ s ≤ n) permutation group on n symbols is of considerable importance in the classical theory of finite permutation groups, which was in the height of its development in the period around the turn of the century. The obvious generalization to a permutation group which is s set-transitive (i.e., a group which, for each pair of s-element unordered subsets S, T of the given n symbols, contains a permutation which carries S into T) seems to have received little attention.

References

1. Bays, S., Sur la transitivité et la primitivité des groupes de substitutions, Comm. Math. Helvet, 22 (1949), 17–30.Google Scholar

2. Breusch, R., Zur Verallgemeinerung des Bertrandschen Postulates, das zwischen x und 2x stets Primzahlen liegen, Math. Zeitschrift, 34 (1932), 505–526.Google Scholar

3. Burnside, W., Theory of groups (Cambridge, 1897).Google Scholar

4. Burnside, W., Note on the simple group of order 504, Math. Ann., 52 (1899), 174–176.Google Scholar

5. Cole, F. N., Note on the substitution groups of six, seven, and eight letters, Bull. New York Math. Soc, 2 (1893), 184–190.Google Scholar

6. Cole, F. N., List of the substitution groups of nine letters, Quart. Jour. Math., 26 (1893), 372–388.Google Scholar

7. Miller, G. A., Collected works, vols. I and III (Urbana, 1935 and 1946).Google Scholar

8. von Neumann, J. and Morgenstern, O., Theory of games and economic behavior (Princeton, 1947).Google Scholar

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Specht, Wilhelm 1956. Gruppentheorie. p. 24.

1964. Finite Permutation Groups. p. 104.

Hughes, D. R. 1964. Onk-homogeneous groups. Archiv der Mathematik, Vol. 15, Issue. 1, p. 401.

Livingstone, Donald and Wagner, Ascher 1965. Transitivity of finite permutation groups on unordered sets. Mathematische Zeitschrift, Vol. 90, Issue. 5, p. 393.

Bouwer, I. Z. 1969. The Many Facets of Graph Theory. Vol. 110, Issue. , p. 55.

Bercov, Ronald D. and Hobby, Charles R. 1970. Permutation groups on unordered sets. Mathematische Zeitschrift, Vol. 115, Issue. 3, p. 165.

Lane, Richard N 1971. t-Designs and t-ply homogeneous groups. Journal of Combinatorial Theory, Series A, Vol. 10, Issue. 2, p. 106.

Alltop, W.O 1972. An infinite class of 5-designs. Journal of Combinatorial Theory, Series A, Vol. 12, Issue. 3, p. 390.

Pouzet, Maurice 1976. Application d'une propri�t� combinatoire des parties d'un ensemble aux groupes et aux relations. Mathematische Zeitschrift, Vol. 150, Issue. 2, p. 117.

Cameron, Peter J. 1977. Higher Combinatorics. p. 217.

Pouzet, Maurice 1979. Relations non reconstructibles par leurs restrictions. Journal of Combinatorial Theory, Series B, Vol. 26, Issue. 1, p. 22.

Godsil, C.D. 1980. More odd graph theory. Discrete Mathematics, Vol. 32, Issue. 2, p. 205.

Inglis, Nicholas F. J. 1984. On orbit equivalent permutation groups. Archiv der Mathematik, Vol. 43, Issue. 4, p. 297.

Siemons, Johannes and Wagner, Ascher 1985. On finite permutation groups with the same orbits on unordered sets. Archiv der Mathematik, Vol. 45, Issue. 6, p. 492.

Clote, P. and Kranakis, E. 1989. Boolean functions, invariance groups and parallel complexity. p. 55.

Colte, Peter and Kranakis, Evangelos 1991. Boolean Functions, Invariance Groups, and Parallel Complexity. SIAM Journal on Computing, Vol. 20, Issue. 3, p. 553.

Field, M. J. and Richardson, R. W. 1992. Symmetry breaking and branching patterns in equivariant bifurcation theory II. Archive for Rational Mechanics and Analysis, Vol. 120, Issue. 2, p. 147.

Babai, László and Pyber, László 1994. Permutation groups without exponentially many orbits on the power set. Journal of Combinatorial Theory, Series A, Vol. 66, Issue. 1, p. 160.

Kisielewicz, Andrzej 1998. Symmetry Groups of Boolean Functions and Constructions of Permutation Groups. Journal of Algebra, Vol. 199, Issue. 2, p. 379.

Reid, James D. and Wickless, William J. 1999. Abelian Groups and Modules. p. 1.

Download full list

Article contents

Set-Transitive Permutation Groups

Extract

References

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests