<?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-07-27T17:10:48Z</responseDate>
  <request identifier="6657" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:6657</identifier>
        <datestamp>2024-03-06T10:38:36Z</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>Lower Bounds on Same-Set Inner Product in Correlated Spaces</dc:title>
          <dc:creator>Hazla, Jan</dc:creator>
          <dc:creator>Holenstein, Thomas</dc:creator>
          <dc:creator>Mossel, Elchanan</dc:creator>
          <dc:subject>same set hitting</dc:subject>
          <dc:subject>product spaces</dc:subject>
          <dc:subject>correlation</dc:subject>
          <dc:subject>lower bounds</dc:subject>
          <dc:description>Let P be a probability distribution over a finite alphabet Omega^L with all L marginals equal. Let X^(1), ..., X^(L), where X^(j) = (X_1^(j), ..., X_n^(j)) be random vectors such that for every coordinate i in [n] the tuples (X_i^(1), ..., X_i^(L)) are i.i.d. according to P.&#13;
&#13;
The question we address is: does there exist a function c_P independent of n such that for every f: Omega^n -&gt; [0, 1] with E[f(X^(1))] = m &gt; 0 we have E[f(X^(1)) * ... * f(X^(n))] &gt; c_P(m) &gt; 0?&#13;
&#13;
We settle the question for L=2 and when L&gt;2 and P has bounded correlation smaller than 1.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Jan Hazla and Thomas Holenstein and Elchanan Mossel</dc:contributor>
          <dc:date>2016</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)</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.APPROX-RANDOM.2016.34</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-66571</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.34</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>
