2000 character limit reached
On the ascending and descending chain conditions in the lattice of monoid varieties
Published 22 Feb 2019 in math.GR | (1902.09352v3)
Abstract: In this work we consider monoids as algebras with an associative binary operation and the nullary operation that fixes the identity element. We found an example of two varieties of monoids with finite subvariety lattices such that their join covers one of them and has a continuum cardinality subvariety lattice that violates the ascending chain condition and the descending chain condition.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.