极限群的忠实表示II

B. Fine, G. Rosenberger
{"title":"极限群的忠实表示II","authors":"B. Fine, G. Rosenberger","doi":"10.1515/gcc-2013-0005","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":119576,"journal":{"name":"Groups Complex. Cryptol.","volume":"195 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Faithful representations of limit groups II\",\"authors\":\"B. Fine, G. Rosenberger\",\"doi\":\"10.1515/gcc-2013-0005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":119576,\"journal\":{\"name\":\"Groups Complex. Cryptol.\",\"volume\":\"195 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complex. Cryptol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2013-0005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complex. Cryptol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2013-0005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

摘要在Groups Complex中。Cryptol. 3(2011), 349-355]证明了任意双曲极限群都可以在。这个证明是建设性的,因为对于给定的极限群,给定一个固定的JSJ分解,就可以构造出这个表示。这个证明依赖于表明某些群体的混合物承认忠实的表述也承认这种忠实的表述。在这个简短的笔记中,我们给出了一个优雅的证明,证明对双曲情况的限制可以去掉。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Faithful representations of limit groups II
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the intersection of subgroups in free groups: Echelon subgroups are inert On the dimension of matrix representations of finitely generated torsion free nilpotent groups Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem Non-associative key establishment for left distributive systems Generic complexity of the Diophantine problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1