Recall that a polyadic group is a pair \((G,f)\) where \(f \) is an \(n\)-ary associative operation on \(G\) for a fixed natural number \(n>1\) and for all \(a_1, \ldots, a_n, b \in G \) and \(1 \leq i \leq n\), there exists a unique element \(x \in G\) such that some equation holds. If \(n=2\), a polyadic group and an ordinary group are the same thing. In fact, a profinite polyadic group is a finite polyadic group with the property of the inverse limit. Theorem 4 provides a characterization for any topological polyadic group to be profinite. Finally, for a pseudo-variety of any arbitrary class of groups, the author shows that if such pseudo-variety is closed under the following operators: subgroup, direct product, quotient, or subdirect product, then another new class is also closed with respect to these operators.
- Around the Hosszú-Gluskin theorem for n-ary groups.
- Equations in polyadic groups
- Free n-groups
- scientific article; zbMATH DE number 3699201 (Why is no real title available?)
- scientific article; zbMATH DE number 3582438 (Why is no real title available?)
- scientific article; zbMATH DE number 3192997 (Why is no real title available?)
- On the automorphisms and representations of polyadic groups.
- Polyadic groups.
- Profinite groups.
- Representation theory of polyadic groups.
- Representations of finite polyadic groups.
- Simple polyadic groups.
- Untersuchungen über einen verallgemeinerten Gruppenbegriff.
This page was built for publication: On profinite polyadic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587415)
