若干无穷矩阵群的构造隶属检验

Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation Pub Date : 2018-07-11 DOI:10.1145/3208976.3208983

A. Hulpke

{"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}

引用次数: 3

摘要

我们描述了允许我们将SLn(Z)和Sp2n (Z)的任意元素表示为生成器特别是“标准”发电机组的产物的算法和启发式。对于实验得到的随机乘积元素，它产生的乘积表达式的长度与输入长度竞争。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation

自引率

0.00%

发文量