A campanological problem in group theory. II
Rankin, R. A.; Rankin R. A.; University of Glasgow
Журнал:
Mathematical Proceedings of the Cambridge Philosophical Society
Дата:
1966
Аннотация:
1. Let E be a finite non-null set and write (E) for the family of all permutations of E. Let be a non-null subset of (E) and write () for the subgroup of (E) generated by the members of . For any α ∈ we putso that () is a subgroup of () and is independent of the choice of α in . We suppose that E splits into k disjoint transitivity sets (orbits) E<sub>i</sub>(1 ≤ i ≤ k) with respect to (); thus σE<sub>i</sub> = E<sub>i</sub> for all σ ∈ ().
371.6Кб