$\mathcal {F}$-(almost) greedy bases
-Banach spaces with applications to the efficiency of the Thresholding Greedy Algorithm in the Hardy spaces $\boldsymbol {H_{p}({\mathbb {D}}^{d})}$
$c_0$ or
$ \ell _{p}$
$\boldsymbol {\ell _{p}}$ structures for
$ \boldsymbol {1\le p}$<
$ \boldsymbol {\infty }$
$\mathbf {L_1(L_p)}$ is primary for 1 < p < ∞
$\mathbb {R}^{n}$ with consecutive digit sets
$\textbf {0<p<1}$