<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>Conditional quasi-greedy bases in Hilbert and Banach spaces</dc:title>
<dc:creator>Gustavo Garrigos</dc:creator><dc:creator>Przemyslaw Wojtaszczyk</dc:creator>
<dc:subject>41A65</dc:subject><dc:subject>41A46</dc:subject><dc:subject>46B15</dc:subject><dc:subject>thresholding greedy algorithm</dc:subject><dc:subject>quasi-greedy basis</dc:subject><dc:subject>conditional basis</dc:subject>
<dc:description>For quasi-greedy bases $\mathscr{B}$ in Hilbert spaces, we give---answering a question by Temlyakov---an improved bound of the associated conditionality constants $k_N(\mathscr{B})=O(\log N)^{1-\epsilon}$, for some $\epsilon&gt;0$. We show the optimality of this bound with an explicit construction, based on a refinement of the method of Olevskii. This construction leads to other examples of quasi-greedy bases with large $k_N$ in Banach spaces, which are of independent interest.</dc:description>
<dc:publisher>Indiana University Mathematics Journal</dc:publisher>
<dc:date>2014</dc:date>
<dc:type>text</dc:type>
<dc:format>pdf</dc:format>
<dc:identifier>10.1512/iumj.2014.63.5269</dc:identifier>
<dc:source>10.1512/iumj.2014.63.5269</dc:source>
<dc:language>en</dc:language>
<dc:relation>Indiana Univ. Math. J. 63 (2014) 1017 - 1036</dc:relation>
<dc:coverage>state-of-the-art mathematics</dc:coverage>
<dc:rights>http://iumj.org/access/</dc:rights>
</oai_dc:dc>