On the universality of systems of words in permutation groups (Q794757)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the universality of systems of words in permutation groups
scientific article

    Statements

    On the universality of systems of words in permutation groups (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Let \(G\) be a group, \(x_ 1,...,x_ n\) variables, \(y_ 1,...,y_ m\) parameters, and \(w_ i=w_ i(x_ 1,...,x_ n;y_ 1,...,y_ m)\) (\(i\in I)\) group words in these variables and parameters. Then \(W=\{w_ i;\quad i\in I\}\) is called \(G\)-universal if for all \(y_ 1,...,y_ m\in G\) there exist \(x_ 1,...,x_ n\in G\) such that for all \(i\in I,\quad w_ i(x_ 1,...,x_ n;y_ 1,...,y_ m)=e.\) Two groups \(G\) and \(H\) are called equationally equivalent if for any finite set W of words \(w_ i\) as above, \(W\) is \(G\)-universal iff \(W\) is \(H\)-universal, i.e. \(G\) and \(H\) cannot be distinguished by the solvability of a system of finitely many equations in variables and parameters. In the classes of infinite symmetric groups, their normal subgroups, and their factor groups, the authors determine those groups which are equationally equivalent.
    0 references
    group words
    0 references
    equationally equivalent
    0 references
    infinite symmetric groups
    0 references
    normal subgroups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references