Access the full text.
Sign up today, get DeepDyve free for 14 days.
Abstract. In (Groups Complex. Cryptol. 3 (2011), 349–355) we showed that any hyperbolic limit group can be faithfully represented in . The proof was constructive in that given a fixed JSJ decomposition for the given limit group the representation can be constructed. The proof depended on showing that certain amalgams of groups admitting faithful representations into also admit such faithful representations. In this short note we give an elegant proof that the restriction to the hyperbolic case can be removed.
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.