Renormings and symmetry properties of 1-greedy bases

DOI10.1016/j.jat.2011.02.013zbMath1252.41026OpenAlexW2117450252MaRDI QIDQ719346

Edward Odell, Stephen Dilworth, Thomas Schlumprecht, András Zsák

Publication date: 10 October 2011

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2011.02.013

zbMATH Keywords

renorming\(m\)-term approximationsymmetric basissubsymmetric basisgreedy basis

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items

New parameters and Lebesgue-type estimates in greedy approximation ⋮ Counterexamples in isometric theory of symmetric and greedy bases ⋮ Bidemocratic bases and their connections with other greedy-type bases ⋮ Performance of the thresholding greedy algorithm with larger greedy sums ⋮ Renorming spaces with greedy bases ⋮ Orlicz-Garling sequence spaces of difference operator and their domination in Orlicz-Lorentz spaces ⋮ 1-greedy renormings of Garling sequence spaces ⋮ Greedy approximation for biorthogonal systems in quasi-Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of 1-greedy bases
• The best \(m\)-term approximation and greedy algorithms
• The thresholding greedy algorithm, greedy bases, and duality
• On the convergence of greedy algorithms for initial segments of the Haar basis
• The convergence of the greedy algorithm with respect to the Haar system in the spaceL_p(0,1)
• Remarks about Schlumprecht space
• Symmetric bases of locally convex spaces
• Greedy algorithm for general biorthogonal systems