Search arXivSearch

arXiv · 2405.18235

Selector form of Weaver's conjecture, Feichtinger's conjecture, and frame sparsification

Abstract

We show an extension of a probabilistic result of Marcus, Spielman, and Srivastava, which resolved the Kadison-Singer problem, for block diagonal positive semidefinite random matrices. We use this result to show several selector results, which generalize their partition counterparts. This includes a selector form of Weaver's KS$_r$ conjecture for block diagonal trace class operators, which extends a selector result for Bessel sequences, or equivalently rank one matrices, due to Londner and the author. We also show a selector variant of Feichtinger's conjecture for a (possibly infinite) collection of Bessel sequences, extending earlier results for a single Bessel sequence. We prove a generalization of the $R_ε$ conjecture of Casazza, Tremain, and Vershynin for infinite collection of equal norm Bessel sequences. In particular, our selector result yields a conjectured asymptotically optimal bound for a single Bessel sequence in terms of Riesz sequence tightness parameter. We establish an iterated selector form of Weaver's KS$_2$ conjecture and show its applications. This includes a solution of an open problem on nearly unit norm Parseval frames of exponentials, which was posed by Londner and the author. We generalize a discretization result for continuous frames by Freeman and Speegle in two ways. First, we extend their result from the setting of rank one operators to positive trace operator valued measures. Second, we establish a nearly tight discretization of bounded continuous Parseval frames. In particular, our selector result yields an improvement of the result of Nitzan, Olevskii, and Ulanovskii and implies the existence of nearly tight exponential frames for unbounded sets with an explicit control on their frame redundancy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcin Bownik. 2024-05-28. Selector form of Weaver's conjecture, Feichtinger's conjecture, and frame sparsification. https://arxiv.org/abs/2405.18235

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fragment-wise differentiable structures

The $p$-modulus of curves, test plans, upper gradients, charts, differentials, approximations in energy and density of directions are all concepts associated to the theory of Sobolev functions in metric measure spaces. The purpose of this paper is to give an analogous geometric and ``fragment-wise'' theory for Lipschitz functions and Weaver derivations, where $\infty$-modulus of curve fragments, $\ast$-upper gradients and Alberti representations play a central role. We give a new definition of fragment-wise charts and prove that they exists for spaces with finite Hausdorff dimension. We give a replacement for $p$-duality in terms of Alberti representations and $\infty$-modulus and present the theory of $\ast$-upper gradients. Further, we give new and sharper results for approximations of Lipschitz functions, which yields the density of directions. Our results are applicable to all complete and separable metric measure spaces. In the process, we show that there are strong parallels between the Sobolev and Lipschitz worlds.

math.CA

Tensor Derivatives, Unified Tensor-Form Differential Equations, and Model Reduction via Partial Tucker Decomposition

This paper develops a unified tensor calculus for matrix-valued functions and their derivatives, and leverages this framework to construct efficient model reduction techniques for high-dimensional tensor differential equations. We first establish a systematic theory of tensor differentiation, wherein the derivative of a matrix with respect to another matrix is represented as a fourth-order tensor. Building on this calculus, we recast linear ordinary differential equations (ODEs) and partial differential equations(PDEs) into a compact tensor-matrix form $\frac{dX}{dt} = \A\ast X$. The general solution is expressed as $X = \exp(t\A)\ast C$, extending the matrix exponential to the tensor setting. Conditions under which the solution admits this exponential form are characterized in terms of the commutativity of the associated matrix slices. We introduce the partial Tucker decomposition (parTuckerD) to address the computational challenges posed by high-order tensor systems. On a synthetic electronic health record (EHR) tensor, parTuckerD achieves a relative reconstruction error of $0.0992$ with a $136.3\times$ compression ratio, matching the accuracy of the full TuckerD while preserving patient-level similarity structure. The results demonstrate that the proposed tensor calculus and parTuckerD framework provide a principle and computationally efficient approach for analyzing and solving high-dimensional tensor differential equations arising in data-intensive applications.

math.CA

Distance preservers for Lobachevsky space

We obtain a complete description of the class of entrywise preservers of Lorentz-Gram matrices. This resolves, for the case of constant negative curvature, the classification of entrywise preservers obtained by Schoenberg in the zero-curvature (Euclidean) and constant-positive-curvature (spherical) settings. These preservers admit a Lévy--Khintchine-type representation and their asymptotic characteristics are related to Krein's classification of screw lines in Lobachevsky space. Connections with complete Nevanlinna--Pick kernels and Bochner subordination are also obtained.

math.CA