{"title":"若干无穷矩阵群的构造隶属检验","authors":"A. Hulpke","doi":"10.1145/3208976.3208983","DOIUrl":null,"url":null,"abstract":"We describe algorithms and heuristics that allow us to express arbitrary elements of SLn(Z) and Sp2n (Z) as products of generators in particular \"standard\" generating sets. For elements obtained experimentally as random products, it produces product expressions whose lengths are competitive with the input lengths.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Constructive Membership Tests in Some Infinite Matrix Groups\",\"authors\":\"A. Hulpke\",\"doi\":\"10.1145/3208976.3208983\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe algorithms and heuristics that allow us to express arbitrary elements of SLn(Z) and Sp2n (Z) as products of generators in particular \\\"standard\\\" generating sets. For elements obtained experimentally as random products, it produces product expressions whose lengths are competitive with the input lengths.\",\"PeriodicalId\":105762,\"journal\":{\"name\":\"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3208976.3208983\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3208976.3208983","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Constructive Membership Tests in Some Infinite Matrix Groups
We describe algorithms and heuristics that allow us to express arbitrary elements of SLn(Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it produces product expressions whose lengths are competitive with the input lengths.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
