Non-finitely related and finitely related monoids

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 M(ab2a, a2b2) is non-finitely related. We also give a sufficient condition under which a monoid is finitely related and use it show that M(a2b2) is finitely related. Together with the results of Glasson this completes the description of all finitely related monoids among the monoids of the form M(W) where every word u ∈ W depends on two variables and every variable occurs twice in u.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…