References
- Biringer, I., Schmidt, B. (2008). The three gap theorem and Riemannian geometry. Geom. Dedicata 136: 175–190. 10.1007/s10711-008-9283-8
- de Laat, D., Leijenhorst, N. (2022). Solving clustered low-rank semidefinite programs arising from polynomial optimization. ArXiv preprint arXiv:2202.12077.
- Haynes, A., Marklof, J. (2022). A five distance theorem for Kronecker sequences. Int. Math. Res. Not. 2022(24): 19747–19789. 10.1093/imrn/rnab205
- Haynes, A., Ramirez, J. J. (2021). Higher-dimensional gap theorems for the maximum metric. Int. J. Number Theory 17: 1665–1670. 10.1142/S1793042121500548
- Kellendonk, J., Lenz, D., Savinien, J. (2015). Mathematics of Aperiodic Order, Vol. 309. Basel: Springer.
- Machado, F. C., de Oliveira Filho, F. M. (2018). Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry. Exp. Math. 27: 362–369. 10.1080/10586458.2017.1286273
- Rankin, R. A. (1955). The closest packing of spherical caps in n dimensions. Glasgow Math. J. 2: 139–144. 10.1017/S2040618500033219
- Sós, V. T. (1957). On the theory of Diophantine approximations. I 1 (on a problem of A. Ostrowski). Acta Math. Hungarica 8: 461–472. 10.1007/BF02020329
- Sós, V. T. (1958). On the distribution mod 1 of the sequence nα. Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 1: 127–134.
- Świerczkowski, S. (1958). On successive settings of an arc on the circumference of a circle. Fundamenta Math. 46: 187–189. 10.4064/fm-46-2-187-189
- Weiß, C. (2022). Multi-dimensional Kronecker sequences with a small number of gap lengths. Discrete Math. Appl. 32: 69–74. 10.1515/dma-2022-0006