2000 character limit reached
Conditional quasi-greedy bases in Hilbert and Banach spaces
Published 21 Jan 2013 in math.FA and math.CA | (1301.4844v1)
Abstract: We show that, for quasi-greedy bases in Hilbert spaces, the associated conditionality constants grow at most as $O(\log N){1-\epsilon}$, for some $\epsilon>0$, answering a question by Temlyakov. 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.