No label defined (Q3333221)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3865541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3865541 |
Statements
1984
0 references
doubly-transitive permutation groups
0 references
primitivity
0 references
0.9245101
0 references
0.9108422
0 references
0 references
0 references
0.8878316
0 references
Let G be a permutation group acting on a set X of cardinality at least 3. \textit{H. Wielandt} has given the following criterion [cf. Permutation groups through invariant relations and invariant functions. Lectures, given at Ohio State University, Columbus, Ohio (1969)]: Theorem: G is doubly-transitive on X if and only if the following hold: (i) G is primitive on X. (ii) There exist distinct elements x,y in X such that (a) There exists g in G such that \(xg=y\) and \(yg=x\). (b) For any z in \(X\backslash \{x,y\}\) there exists h in \(G_ z\) such that \(xh=y.\) Whereas Wielandt's proof is an application of his concept of 2-closure, the present author uses his concept of ''Gruppenräume'' [Abh. Math. Semin. Univ. Hamb. 44, 203-221 (1976; Zbl 0318.20002)] to obtain a slight generalization of the criterion (Satz 2). Reviewer's remark: Both, Wielandt's criterion and the author's Satz 2 may be obtained elementarily, using the graph (or relation) theoretic approach to primitivity.
0 references