Decision problems for inverse monoids presented by a single sparse relator

Susan Hermiller, Steven Lindblad, John Meakin

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that…