Publication

Computing relative abelian kernels of finite monoids

View document

Bibliographic Details
Summary:Let H be a pseudovariety of abelian groups corresponding to a recursive supernatural number. In this note we explain how a concrete implementation of an algorithm to compute the kernel of a finite monoid relative to H can be achieved. The case of the pseudovariety Ab of all finite abelian groups was already treated by the second author and plays an important role here, where we will be interested in the proper subpseudovarieties of Ab. Our work relies on an algorithm obtained by Steinberg.
Main Authors:Cordeiro, Edite
Other Authors:Delgado, Manuel
Subject:Recursive supernatural number Subpseudovarieties of abelian groups Relative closures of subgroups of the free abelian
Year:2006
Country:Portugal
Document type:article
Access type:open access
Associated institution:Instituto Politécnico de Bragança
Language:English
Origin:Biblioteca Digital do IPB
Description
Summary:Let H be a pseudovariety of abelian groups corresponding to a recursive supernatural number. In this note we explain how a concrete implementation of an algorithm to compute the kernel of a finite monoid relative to H can be achieved. The case of the pseudovariety Ab of all finite abelian groups was already treated by the second author and plays an important role here, where we will be interested in the proper subpseudovarieties of Ab. Our work relies on an algorithm obtained by Steinberg.