Mathematics Faculty Articles
A Minimal Pseudo-complex Monoid
Document Type
Article
Publication Date
1-2023
Publication Title
Archiv der Mathematik
Keywords
Monoid, Semigroup, Variety, Lattice of varieties
ISSN
0003-889X
Volume
120
Issue/No.
1
First Page
15
Last Page
25
Abstract
A monoid is pseudo-complex if the semigroup variety it generates has uncountably many subvarieties, while the monoid variety it generates has only finitely many subvarieties. The smallest pseudo-complex monoid currently known is of order seven. The present article exhibits a pseudo-complex monoid of order six and shows that every smaller monoid is not pseudo-complex. Consequently, minimal pseudo-complex monoids are of order six.
NSUWorks Citation
Lee, Edmond W. H., "A Minimal Pseudo-complex Monoid" (2023). Mathematics Faculty Articles. 350.
https://nsuworks.nova.edu/math_facarticles/350
ORCID ID
0000-0002-1662-3734
ResearcherID
I-6970-2013
DOI
10.1007/s00013-022-01797-z
