Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter April 20, 2018

Certifying numerical estimates of spectral gaps

Marek Kaluba ORCID logo EMAIL logo and Piotr W. Nowak ORCID logo

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.

MSC 2010: 16S34; 20C07; 20C40

Funding source: Narodowe Centrum Nauki

Award Identifier / Grant number: 2015/19/B/ST1/01458

Award Identifier / Grant number: 677120-INDEX

Funding statement: The first author has been partially supported by the National Science Centre, under grant number 2015/19/B/ST1/01458. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 677120-INDEX).

Acknowledgements

We would like to thank Dawid Kielak and Taka Ozawa for valuable comments.

References

[1] B. Bekka, P. de la Harpe and A. Valette, Kazhdan’s Property (T), New Math. Monogr. 11, Cambridge University Press, Cambridge, 2008. 10.1017/CBO9780511542749Search in Google Scholar

[2] J. Bezanson, A. Edelman, S. Karpinski and V. B. Shah, Julia: A fresh approach to numerical computing, SIAM Rev. 59 (2017), no. 1, 65–98. 10.1137/141000671Search in Google Scholar

[3] S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, 2004. 10.1017/CBO9780511804441Search in Google Scholar

[4] M. Burger, Kazhdan constants for SL(3,𝐙), J. Reine Angew. Math. 413 (1991), 36–67. Search in Google Scholar

[5] I. Dunning, J. Huchette and M. Lubin, JuMP: A modeling language for mathematical optimization, SIAM Rev. 59 (2017), no. 2, 295–320. 10.1137/15M1020575Search in Google Scholar

[6] K. Fujiwara and Y. Kabaya, Computing Kazhdan constants by semidefinite programming, preprint (2017), https://arxiv.org/abs/1703.04555. 10.1080/10586458.2017.1396509Search in Google Scholar

[7] U. Hadad, Uniform Kazhdan constant for some families of linear groups, J. Algebra 318 (2007), no. 2, 607–618. 10.1016/j.jalgebra.2007.08.012Search in Google Scholar

[8] B. He and X. Yuan, On the O(1/n) convergence rate of the Douglas–Rachford alternating direction method, SIAM J. Numer. Anal. 50 (2012), no. 2, 700–709. 10.1137/110836936Search in Google Scholar

[9] M. Kassabov, Kazhdan constants for SLn(), Internat. J. Algebra Comput. 15 (2005), no. 5–6, 971–995. 10.1142/S0218196705002712Search in Google Scholar

[10] T. Netzer, Real algebraic geometry and its applications, preprint (2016), https://arxiv.org/abs/1606.07284. Search in Google Scholar

[11] T. Netzer and A. Thom, Real closed separation theorems and applications to group algebras, Pacific J. Math. 263 (2013), no. 2, 435–452. 10.2140/pjm.2013.263.435Search in Google Scholar

[12] T. Netzer and A. Thom, Kazhdan’s property (T) via semidefinite optimization, Exp. Math. 24 (2015), no. 3, 371–374. 10.1080/10586458.2014.999149Search in Google Scholar

[13] B. O’Donoghue, E. Chu, N. Parikh and S. Boyd, Conic optimization via operator splitting and homogeneous self-dual embedding, J. Optim. Theory Appl. 169 (2016), no. 3, 1042–1068. 10.1007/s10957-016-0892-3Search in Google Scholar

[14] N. Ozawa, Noncommutative real algebraic geometry of Kazhdan’s property (T), J. Inst. Math. Jussieu 15 (2016), no. 1, 85–90. 10.1017/S1474748014000309Search in Google Scholar

[15] K. Schmüdgen, Noncommutative real algebraic geometry – some basic concepts and first ideas, Emerging Applications of Algebraic Geometry, Springer, New York (2009), 325–350. 10.1007/978-0-387-09686-5_9Search in Google Scholar

[16] Y. Shalom, Bounded generation and Kazhdan’s property (T), Publ. Math. Inst. Hautes Études Sci. (1999), no. 90, 145–168. 10.1007/BF02698832Search in Google Scholar

[17] W. Tucker, Validated Numerics. A Short Introduction to Rigorous Computations, Princeton University Press, Princeton, 2011. 10.1515/9781400838974Search in Google Scholar

[18] L. Tunçel, Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization, Fields Inst. Monogr. 27, American Mathematical Society, Providence, 2010. 10.1090/fim/027Search in Google Scholar

[19] L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev. 38 (1996), no. 1, 49–95. 10.1137/1038003Search in Google Scholar

[20] The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.8.6, 2016. Search in Google Scholar

Received: 2017-4-12
Published Online: 2018-4-20
Published in Print: 2018-5-1

© 2018 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 27.1.2023 from https://www.degruyter.com/document/doi/10.1515/gcc-2018-0004/html
Scroll Up Arrow