z-logo
open-access-imgOpen Access
Non-equivalent greedy and almost greedy bases inlp
Author(s) -
S. J. Dilworth,
Mark R. Hoffmann,
Denka Kutzarova
Publication year - 2006
Publication title -
journal of function spaces
Language(s) - English
Resource type - Journals
eISSN - 2314-8896
pISSN - 2314-8888
DOI - 10.1155/2006/368648
Subject(s) - algorithm , cardinality (data modeling) , mathematics , database , artificial intelligence , computer science
For 1 < p < 8 and p ? 2 we construct a family of mutually non-equivalent greedy bases in lp having the cardinality of the continuum. In fact, no basis from this family is equivalent to a rearranged subsequence of any other basis thereof. We are able to extend this statement to the spaces Lp and H1. Moreover, the technique used in the proof adapts to the setting of almost greedy bases where similar results are obtained

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom