Abstract
Let ℒ be an n-dimensional lattice, and let x be a point chosen uniformly from a large ball in ℝn. In this note we consider the distribution of the distance from x to ℒ, normalized by the largest possible such distance (i.e., the covering radius of ℒ). By definition, the support of this distribution is [0,1]. We show that there exists a universal constant α 2 that provides a natural “threshold” for this distribution in the following sense. For any ε>0, there exists a δ>0 such that for any lattice, this distribution has mass at least δ on [α 2−ε,1]; moreover, there exist lattices for which the distribution is tightly concentrated around α 2 (and so the mass on [α 2+ε,1] can be arbitrarily small). We also provide several bounds on α 2 and its extension to other ℓ p norms. We end with an application from the area of computational complexity. Namely, we show that α 2 is exactly the approximation factor of a certain natural \(\mathsf{AM}\) protocol for the Covering Radius Problem.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley–Interscience Series in Discrete Mathematics and Optimization. Wiley–Interscience, New York (2000)
Barnes, E.S.: The covering of space by spheres. Can. J. Math. 8, 293–304 (1956)
Barnes, E.S., Sloane, N.J.A.: The optimal lattice quantizer in three dimensions. SIAM J. Algebr. Discrete Methods 4(1), 30–41 (1983)
Boppana, R., Håstad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett. 25, 127–132 (1987)
Conway, J.H., Sloane, N.J.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, Berlin (1998)
Durbin, J.: Distribution Theory for Tests Based on the Sample Distribution Function. SIAM CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia (1973)
Forney, G.D., Jr.: On the duality of coding and quantizing. In: Coding and Quantization, Piscataway, NJ, 1992. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 14, pp. 1–14. Am. Math. Soc., Providence (1993)
Guruswami, V., Micciancio, D., Regev, O.: The complexity of the covering radius problem on lattices and codes. Comput. Complex. 14(2), 90–121 (2005). Preliminary version in CCC’04
Haviv, I., Regev, O.: Hardness of the covering radius problem on lattices. In: Proc. of 21th IEEE Annual Conference on Computational Complexity (CCC) (2006)
Papadimitriou, C.H.: Computational Complexity. Addison–Wesley, Reading (1994)
Vallentin, F.: Sphere covering, lattices, and tilings (in low dimensions). Ph.D. thesis, Munich University of Technology (2003)
Author information
Authors and Affiliations
Additional information
I. Haviv’s research was supported by the Binational Science Foundation and by the Israel Science Foundation.
V. Lyubashevsky’s research was supported by NSF ITR 0313241.
O. Regev’s research was supported by an Alon Fellowship, by the Binational Science Foundation, by the Israel Science Foundation, and by the European Commission under the Integrated Project QAP funded by the IST directorate as Contract Number 015848.
Rights and permissions
About this article
Cite this article
Haviv, I., Lyubashevsky, V. & Regev, O. A Note on the Distribution of the Distance from a Lattice. Discrete Comput Geom 41, 162–176 (2009). https://doi.org/10.1007/s00454-008-9123-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9123-5