Skip to main content
Log in

Entropy-based bounds on dimension reduction in L 1

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

We show that for every large enough integer N, there exists an N-point subset of L 1 such that for every D > 1, embedding it into d1 with distortion D requires dimension d at least \({N^{\Omega (1/{D^2})}}\), and that for every ɛ > 0 and large enough integer N, there exists an N-point subset of L 1 such that embedding it into d1 with distortion 1 + ɛ requires dimension d at least \({N^{\Omega (1/{D^2})}}\)). These results were previously proven by Brinkman and Charikar [JACM, 2005] and by Andoni, Charikar, Neiman and Nguyen [FOCS 2011]. We provide an alternative and arguably more intuitive proof based on an entropy argument.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Andoni, M. S. Charikar, O. Neiman and H. L. Nguyen., Near linear lower bounds for dimension reduction in1, in Proceedings of the 52nd IEEE FOCS, Palm Springs, California, 2011.

    Google Scholar 

  2. B. Brinkman and M. Charikar, On the impossibility of dimension reduction in1, Journal of the Association of Computing Machinery 52 (2005), 766–788.

    Article  MathSciNet  Google Scholar 

  3. T. M. Cover and J. A. Thomas, Elements of Information Theory (2nd edition), Wiley, New York, 2006.

    MATH  Google Scholar 

  4. J. R. Lee and A. Naor, Embedding the diamond graph in L p and dimension reduction in L 1, Geometric and Functional Analysis 14 (2004), 745–747.

    Article  MathSciNet  MATH  Google Scholar 

  5. A. Nayak, Optimal lower bounds for quantum automata and random access codes, in Proceedings of the 40th IEEE FOCS, New York City, New York, 1999, pp. 369–376.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported by the Israel Science Foundation and by a European Research Council (ERC) Starting Grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Regev, O. Entropy-based bounds on dimension reduction in L 1 . Isr. J. Math. 195, 825–832 (2013). https://doi.org/10.1007/s11856-012-0137-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11856-012-0137-6

Keywords

Navigation