Non-finitely related and finitely related monoids
arXiv:2502.02157
Abstract
We transform the method of Glasson into a sufficient condition under which a monoid is non-finitely related, add a new member to the collection of interlocking word-patterns, and use it to show that the monoid is non-finitely related. We also give a sufficient condition under which a monoid is finitely related and use it show that is finitely related. Together with the results of Glasson this completes the description of all finitely related monoids among the monoids of the form where every word depends on two variables and every variable occurs twice in .
arXiv commentChanged title. To appear in Semigroup Forum