On profinite polyadic groups (Q6587415)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On profinite polyadic groups |
scientific article; zbMATH DE number 7896796
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On profinite polyadic groups |
scientific article; zbMATH DE number 7896796 |
Statements
On profinite polyadic groups (English)
0 references
14 August 2024
0 references
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.
0 references
polyadic groups
0 references
\(n\)-ary groups
0 references
profinite groups
0 references
Post's cover
0 references
retract of polyadic group
0 references