Linearly Embedding Sparse Vectors from 2 to 1 via Deterministic Dimension-Reducing Maps

Abstract

This note is concerned with deterministic constructions of m × N matrices satisfying a restricted isometry property from 2 to 1 on s-sparse vectors. Similarly to the standard (2 to 2) restricted isometry property, such constructions can be found in the regime m s2, at least in theory. With effectiveness of implementation in mind, two simple constructions are presented in the less pleasing but still relevant regime m s4. The first one, executing a Las Vegas strategy, is quasideterministic and applies in the real setting. The second one, exploiting Golomb rulers, is explicit and applies to the complex setting. As a stepping stone, an explicit isometric embedding from 2n(C) to 4cn2(C) is presented. Finally, the extension of the problem from sparse vectors to low-rank matrices is raised as an open question.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…