<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-14T17:32:36Z</responseDate>
  <request identifier="7182" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:7182</identifier>
        <datestamp>2024-03-06T10:40:02Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Spectral Gap Precludes Low-Dimensional Embeddings</dc:title>
          <dc:creator>Naor, Assaf</dc:creator>
          <dc:subject>Metric embeddings</dc:subject>
          <dc:subject>dimensionality reduction</dc:subject>
          <dc:subject>expander graphs</dc:subject>
          <dc:subject>nonlinear spectral gaps</dc:subject>
          <dc:subject>nearest neighbor search</dc:subject>
          <dc:subject>complex interpolation</dc:subject>
          <dc:subject>Markov type.</dc:subject>
          <dc:description>We prove that if an n-vertex O(1)-expander embeds with average distortion D into a finite dimensional normed space X, then necessarily the dimension of X is at least n^{c/D} for some universal constant c&gt;0. This is sharp up to the value of the constant c, and it improves over the previously best-known estimate dim(X)&gt; c(log n)^2/D^2 of Linial, London and Rabinovich,  strengthens a theorem of Matousek, and answers a question of Andoni, Nikolov, Razenshteyn and Waingarten.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Assaf Naor</dc:contributor>
          <dc:date>2017</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.SoCG.2017.50</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-71822</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.50</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
