Repository logo
 
No Thumbnail Available
Publication

Computing relative abelian kernels of finite monoids

Use this identifier to reference this record.
Name:Description:Size:Format: 
Computing_Relative_Abelian_Kernels_preprint.pdf345.11 KBAdobe PDF Download

Advisor(s)

Abstract(s)

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.

Description

Keywords

Recursive supernatural number Subpseudovarieties of abelian groups Relative closures of subgroups of the free abelian

Citation

Cordeiro, Edite; Delgado, M. (2006). Computing relative abelian kernels of finite monoids. Journal of Algebra. ISSN 0021-8693. 303:2 p.642--654

Research Projects

Organizational Units

Journal Issue