On weighted greedy-type bases

Abstract: In this paper, we study weights for the Thresholding Greedy Algorithm (TGA). While previous work focused on sequential weights

v a r s i g m a = (s_{n})_{n i n m a t h b b N}

on each positive integer, we study a more general weight

o m e g a = (w_{A})_{A s u b s e t m a t h b b N}

on each set

A s u b s e t m a t h b b N

. We define and characterize

o m e g a

-(almost) greedy bases. Furthermore, we leverage existing results to show that there exists an

o m e g a

-greedy unconditional basis that is not

v a r s i g m a

-almost greedy for any weight sequence

v a r s i g m a

. Last but not least, we show the equivalence between

o m e g a

-semi-greedy bases and

o m e g a

-almost greedy bases when

o m e g a

is a so-called structured weight, thus considerably extending the equivalence previously known to hold for sequential weights.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: On weighted greedy-type bases