Schreier families and \(\mathcal{F}\)-(almost) greedy bases

DOI10.4153/S0008414X23000378MaRDI QIDQ6622790

Kevin Beanland, Hùng Việt Chu

Publication date: 22 October 2024

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

thresholding greedy algorithmSchreier familiesSchreier unconditional

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of 1-almost greedy bases
• Greedy bases for Besov spaces
• Characterization of 1-greedy bases
• Convex unconditionality and summability of weakly null sequences
• The thresholding greedy algorithm, greedy bases, and duality
• Lebesgue inequalities for the greedy algorithm in general bases
• No greedy bases for matrix spaces with mixed \(\ell_p\) and \(\ell_q\) norms
• A study of conditional spreading sequences
• Unconditional structures of weakly null sequences
• A remark on greedy approximation in Banach spaces.
• Topics in Banach Space Theory
• Methods in the theory of hereditarily indecomposable Banach spaces
• Greedy algorithm for general biorthogonal systems

This page was built for publication: Schreier families and \(\mathcal{F}\)-(almost) greedy bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622790)