arXiv subjects

Mitchell Taylor

Publications and source records attributed to Mitchell Taylor.

2 recordsLinked to original sources

arXiv2026

Maximal inequalities, frames and greedy algorithms

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 convergent if and only if a certain maximal inequality is satisfied. We then show that absolute frames need not admit a reconstruction algorithm with respect to the usual order convergence, but do allow for reconstruction with respect to the order convergence inherited from the double dual. After this, we investigate the extent to which such coordinate systems affect the geometry of the underlying function space. Most notably, we prove that a Banach lattice $X$ is lattice isomorphic to a closed sublattice of a $C(K)$-space if and only if every unconditional sequence in $X$ is absolute.

math.FA↗

arXiv2025

On the existence of large subspaces of $C(K)$ that perform stable phase retrieval

The purpose of this article is to address an open problem posed by Freeman-Oikhberg-Pineau-T.~(\textit{Math.~Ann.}~2024) regarding the existence of large subspaces of $C(K)$ that perform stable phase retrieval (SPR). We begin by proving that for both the real and complex fields, the space $C(K)$ admits an infinite-dimensional SPR subspace if and only if the second Cantor-Bendixson derivative $K{''}$ is nonempty. We then show how to construct ``large" SPR subspaces of $C(K)$, where the size of the subspace depends quantitatively on the number of non-trivial Cantor-Bendixson derivatives that the compact Hausdorff space $K$ possesses.

math.FA↗