Computing Kazhdan constants by semidefinite programming

From MaRDI portal
Publication:5228847

DOI10.1080/10586458.2017.1396509zbMATH Open1420.22007arXiv1703.04555OpenAlexW2964274364MaRDI QIDQ5228847FDOQ5228847


Authors:


Publication date: 13 August 2019

Published in: Experimental Mathematics (Search for Journal in Brave)

Abstract: Kazhdan constants of discrete groups are hard to compute and the actual constants are known only for several classes of groups. By solving a semidefinite programming problem by a computer, we obtain a lower bound of the Kazhdan constant of a discrete group. Positive lower bounds imply that the group has property (T). We study lattices on ildeA2-buildings in detail. For ildeA2-groups, our numerical bounds look identical to the known actual constants. That suggests that our approach is effective. For a family of groups, G1,cdots,G4, that are studied by Ronan, Tits and others, we conjecture the spectral gap of the Laplacian is (sqrt21)2 based on our experimental results. For mathrmSL(3,BbbZ) and mathrmSL(4,BbbZ) we obtain lower bounds of the Kazhdan constants, 0.2155 and 0.3285, respectively, which are better than any other known bounds. We also obtain 0.1710 as a lower bound of the Kazhdan constant of the Steinberg group mathrmSt3(BbbZ).


Full work available at URL: https://arxiv.org/abs/1703.04555




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Computing Kazhdan constants by semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228847)