Skip to main content

Abstract

We show that for every n-dimensional lattice \({\mathcal L}\) the torus \({\mathbb{R}}^n / {\mathcal L}\) can be embedded with distortion \(O(n \cdot \sqrt{\log{n}})\) into a Hilbert space. This improves the exponential upper bound of O(n 3n/2) due to Khot and Naor (FOCS 2005, Math. Annal. 2006) and gets close to their lower bound of \(\Omega(\sqrt{n})\). We also obtain tight bounds for certain families of lattices.

Our main new ingredient is an embedding that maps any point \(u \in {\mathbb{R}}^n/{\mathcal L}\) to a Gaussian function centered at u in the Hilbert space \(L_2({\mathbb{R}}^n/{\mathcal L})\). The proofs involve Gaussian measures on lattices, the smoothing parameter of lattices and Korkine-Zolotarev bases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aharonov, D., Regev, O.: Lattice problems in NP intersect coNP. Journal of the ACM 52(5), 749–765 (2005); Preliminary version in FOCS 2004

    Article  MathSciNet  Google Scholar 

  2. Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296(4), 625–635 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Feige, U., Micciancio, D.: The inapproximability of lattice and coding problems with preprocessing. J. Comput. System Sci. 69(1), 45–67 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Khot, S., Naor, A.: Nonembeddability theorems via Fourier analysis. Mathematische Annalen 334(4), 821–852 (2006); Preliminary version in FOCS 2005

    Article  MATH  MathSciNet  Google Scholar 

  5. Korkine, A., Zolotareff, G.: Sur les formes quadratiques. Mathematische Annalen 6, 366–389 (1873)

    Article  MathSciNet  Google Scholar 

  6. Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston (2002)

    MATH  Google Scholar 

  7. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM Journal on Computing 37(1), 267–302 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In: Proc. 42nd ACM Symposium on Theory of Computing (STOC), pp. 351–358 (2010)

    Google Scholar 

  9. Milnor, J., Husemoller, D.: Symmetric bilinear forms. Springer, Berlin (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haviv, I., Regev, O. (2010). The Euclidean Distortion of Flat Tori. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2010 2010. Lecture Notes in Computer Science, vol 6302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15369-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15369-3_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15368-6

  • Online ISBN: 978-3-642-15369-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics