Skip to main content
Article
A Minimal Pseudo-complex Monoid
Archiv der Mathematik
  • Edmond W. H. Lee, Nova Southeastern University
Document Type
Article
Publication Date
1-1-2023
Keywords
  • Monoid,
  • Semigroup,
  • Variety,
  • Lattice of varieties
Disciplines
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.

ORCID ID
0000-0002-1662-3734
ResearcherID
I-6970-2013
DOI
10.1007/s00013-022-01797-z
Citation Information
Edmond W. H. Lee. "A Minimal Pseudo-complex Monoid" Archiv der Mathematik Vol. 120 Iss. 1 (2023) p. 15 - 25 ISSN: 0003-889X
Available at: http://works.bepress.com/edmond-lee/67/