验证谱隙的数值估计

IF 0.1 Q4 MATHEMATICS

Groups Complexity Cryptology Pub Date : 2017-03-28 DOI:10.1515/gcc-2018-0004

M. Kaluba, P. Nowak

{"title":"验证谱隙的数值估计","authors":"M. Kaluba, P. Nowak","doi":"10.1515/gcc-2018-0004","DOIUrl":null,"url":null,"abstract":"Abstract We establish a lower bound on the spectral gap of the Laplace operator on special linear groups using conic optimisation. In particular, this provides a constructive (but computer assisted) proof that these groups have the Kazhdan property (T). Software for such optimisation for other finitely presented groups is provided.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"18 1","pages":"33 - 41"},"PeriodicalIF":0.1000,"publicationDate":"2017-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Certifying numerical estimates of spectral gaps\",\"authors\":\"M. Kaluba, P. Nowak\",\"doi\":\"10.1515/gcc-2018-0004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We establish a lower bound on the spectral gap of the Laplace operator on special linear groups using conic optimisation. In particular, this provides a constructive (but computer assisted) proof that these groups have the Kazhdan property (T). Software for such optimisation for other finitely presented groups is provided.\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"18 1\",\"pages\":\"33 - 41\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2017-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2018-0004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2018-0004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 8

摘要

摘要利用二次优化方法建立了特殊线性群上拉普拉斯算子谱间隙的下界。特别是，这提供了一个建设性的(但计算机辅助的)证明，证明这些群具有哈萨克斯坦性质(T)。为其他有限呈现的群提供了这种优化软件。

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

查看原文本刊更多论文

Certifying numerical estimates of spectral gaps

Abstract We establish a lower bound on the spectral gap of the Laplace operator on special linear groups using conic optimisation. In particular, this provides a constructive (but computer assisted) proof that these groups have the Kazhdan property (T). Software for such optimisation for other finitely presented groups is provided.

求助全文

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

来源期刊

Groups Complexity Cryptology MATHEMATICS-

CiteScore

1.10

自引率

0.00%

发文量