Basic permutation groups on infinite sets
Salomaa's definition of basic permutation groups cannot be directly generalized to infinite sets. Instead, the author calls a permutation group G on an (infinite) set A basic if for any nontrivial idempotent operation f on A, the algebra \(<A;G\cup \{f\}>\) is locally complete. Making use of a criterion for local completeness due to \textit{I. G. Rosenberg} and the author [Algebra Univers. 18, 308-326 (1984; Zbl 0554.08004)], the following theorem is proved here: Let G be a doubly primitive permutation group on A, such that for every element \(a\in A\), the stabilizer \(G_ a\) admits no nontrivial invariant partial order on the set \(A\setminus \{a\}\). Then for every nontrivial idempotent operation f on A, the algebra \(<A;G\cup \{f\}>\) is either locally complete or affine with respect to an elementary abelian 2-group.
- INFINITE PERMUTATION GROUPS AND MINIMAL SETS
- On a certain infinite permutation group
- Notes on infinite permutation groups
- Notes on infinite permutation groups
- scientific article; zbMATH DE number 17083
- Infinite Bounded Permutation Groups
- scientific article; zbMATH DE number 66613
- SOME INFINITE PERMUTATION GROUPS AND RELATED FINITE LINEAR GROUPS
- scientific article; zbMATH DE number 5155097
- scientific article; zbMATH DE number 1329668
This page was built for publication: Basic permutation groups on infinite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3679253)