Abstract
Let n ≥ 2 be a natural number, X = { x1,…, xn} and let F be the free group, freely generated by X. Let R be a cyclically reduced word in F such that its symmetric closure [Formula: see text] in F satisfies the small cancellation condition C′(1/5) & T(4). Let G be the group presented by [Formula: see text]. A Magnus subsemigroup of G is any subsemigroup of G generated by at most 2n - 1 elements of [Formula: see text]. In this paper we solve the Membership Problem for rational subsets of G which are contained in a Magnus subsemigroup of G, provided that [Formula: see text] satisfies certain combinatorial conditions. We use small cancellation theory with word combinatorics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
