{"title":"的二阶离散自由子群的构造隶属性问题","authors":"B. Eick, M. Kirschmer, C. Leedham-Green","doi":"10.1112/S1461157014000047","DOIUrl":null,"url":null,"abstract":"We exhibit a practical algorithm for solving the constructive membership problem for discrete free subgroups of rank $2$ in $\\mathrm{PSL}_2(\\mathbb{R})$ or $\\mathrm{SL}_2(\\mathbb{R})$ . This algorithm, together with methods for checking whether a two-generator subgroup of $\\mathrm{PSL}_2(\\mathbb{R})$ or $\\mathrm{SL}_2(\\mathbb{R})$ is discrete and free, have been implemented in Magma for groups defined over real algebraic number fields. Supplementary materials are available with this article.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"17 1","pages":"345-359"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157014000047","citationCount":"9","resultStr":"{\"title\":\"The constructive membership problem for discrete free subgroups of rank 2 of\",\"authors\":\"B. Eick, M. Kirschmer, C. Leedham-Green\",\"doi\":\"10.1112/S1461157014000047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We exhibit a practical algorithm for solving the constructive membership problem for discrete free subgroups of rank $2$ in $\\\\mathrm{PSL}_2(\\\\mathbb{R})$ or $\\\\mathrm{SL}_2(\\\\mathbb{R})$ . This algorithm, together with methods for checking whether a two-generator subgroup of $\\\\mathrm{PSL}_2(\\\\mathbb{R})$ or $\\\\mathrm{SL}_2(\\\\mathbb{R})$ is discrete and free, have been implemented in Magma for groups defined over real algebraic number fields. Supplementary materials are available with this article.\",\"PeriodicalId\":54381,\"journal\":{\"name\":\"Lms Journal of Computation and Mathematics\",\"volume\":\"17 1\",\"pages\":\"345-359\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1112/S1461157014000047\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lms Journal of Computation and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1112/S1461157014000047\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lms Journal of Computation and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1112/S1461157014000047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
The constructive membership problem for discrete free subgroups of rank 2 of
We exhibit a practical algorithm for solving the constructive membership problem for discrete free subgroups of rank $2$ in $\mathrm{PSL}_2(\mathbb{R})$ or $\mathrm{SL}_2(\mathbb{R})$ . This algorithm, together with methods for checking whether a two-generator subgroup of $\mathrm{PSL}_2(\mathbb{R})$ or $\mathrm{SL}_2(\mathbb{R})$ is discrete and free, have been implemented in Magma for groups defined over real algebraic number fields. Supplementary materials are available with this article.
期刊介绍:
LMS Journal of Computation and Mathematics has ceased publication. Its final volume is Volume 20 (2017). LMS Journal of Computation and Mathematics is an electronic-only resource that comprises papers on the computational aspects of mathematics, mathematical aspects of computation, and papers in mathematics which benefit from having been published electronically. The journal is refereed to the same high standard as the established LMS journals, and carries a commitment from the LMS to keep it archived into the indefinite future. Access is free until further notice.