2 papers
math.FA2026
Maximal inequalities, frames and greedy algorithms
Pablo Berná, Daniel Freeman, Timur Oikhberg +1
The aim of this article is to use Banach lattice techniques to study coordinate systems in function spaces. We begin by proving that the greedy algorithm of a basis is order conver…
math.FA2025
The lattice Schäffer constant
Michael Alexánder Rincón Villamizar, Timur Oikhberg
For a Banach lattice , its lattice Schäffer constant is defined by: \begin{gather*} λ^+(X)=\inf\{\max\{\|x+y\|,\|x-y\|\}\,\colon\,\|x\|=\|y\|=1,x,y\geq{\bf0}\}. \end{gather*}…