A minimal pseudo-complex monoid

Research output: Contribution to journalArticlepeer-review

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.

Original languageAmerican English
Pages (from-to)15–25
JournalArchiv der Mathematik
Volume120
Issue number1
DOIs
StatePublished - Jan 2023

ASJC Scopus Subject Areas

  • General Mathematics

Keywords

  • Lattice of varieties
  • Monoid
  • Semigroup
  • Variety

Disciplines

  • Mathematics

Cite this