Susan Hermiller
Decision problems for inverse monoids presented by a single sparse relator.
Tue, 11/10/2009 - 16:01 — SomNambulAuthors: Susan Hermiller, Steven Lindblad, John Meakin
Subjects: Group Theory
AbstractWe 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 the word problem for M is decidable. We also show that
the set of words in (X \cup X^{-1})^* that represent the identity in M is a
deterministic context free language, and that the set of geodesics in the
Schutzenberger graph of the identity of M is a regular language.Tame combing and almost convexity conditions.
Thu, 09/03/2009 - 17:38 — SomNambulAuthors: Sean Cleary, Susan Hermiller, Melanie Stein, Jennifer Taback
Subjects: Group Theory
AbstractWe explore relationships between the family of successively weaker almost
convexity conditions, and successively weaker tame combing conditions. We show
that both Thompson's group F and the Baumslag-Solitar groups BS(1,p) with p>2
admit a tame combing with a linear radial tameness function.Tame combing and almost convexity conditions.
Thu, 09/03/2009 - 17:38 — SomNambulAuthors: Sean Cleary, Susan Hermiller, Melanie Stein, Jennifer Taback
Subjects: Group Theory
AbstractWe explore relationships between the family of successively weaker almost
convexity conditions, and successively weaker tame combing conditions. We show
that both Thompson's group F and the Baumslag-Solitar groups BS(1,p) with p>2
admit a tame combing with a linear radial tameness function.
User login
