Abelian pointlikes of a monoid (Q1386717)

From MaRDI portal
Revision as of 03:10, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Abelian pointlikes of a monoid
scientific article

    Statements

    Abelian pointlikes of a monoid (English)
    0 references
    0 references
    7 April 1999
    0 references
    The ``Type II'' kernel \(K(M)\) of a finite monoid \(M\) comprises those elements of \(M\) that lie in the inverse image of the identity element, under every relational morphism from \(M\) into a finite group. The kernel plays an important role in the study of semidirect products and Malcev products of pseudovarieties of monoids (and semigroups in general). The ``Rhodes conjecture'' stated that membership in \(K(M)\) is determined by quite a simple algorithm. It was first proved by \textit{C. J. Ash} [Int. J. Algebra Comput. 1, No. 1, 127-146 (1991; Zbl 0722.20039)] and independently by \textit{L. Ribes} and \textit{P. A. Zalesskij} [Bull. Lond. Math. Soc. 25, No. 1, 37-43 (1993; Zbl 0811.20026)], the latter using the methods of profinite group theory. The author considers the abelian kernel of a finite monoid -- where only relational morphisms into abelian groups are allowed -- by studying the profinite topology of free abelian groups. Together with a little linear algebra, this work enables him to find an algorithm to determine membership in the abelian kernel and to obtain some information about the pointlikes with respect to such morphisms (a pointlike set must be contained in the inverse image of a single element, for every relational morphism into an abelian group).
    0 references
    finite monoids
    0 references
    kernels
    0 references
    semidirect products
    0 references
    Malcev products
    0 references
    pseudovarieties of monoids
    0 references
    abelian kernels
    0 references
    relational morphisms
    0 references
    profinite topology of free Abelian groups
    0 references
    algorithms
    0 references
    membership problem
    0 references
    pointlikes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references