# Noncommutative Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem

Source: [Noncommutative Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem](<https://www.sota2.com/research/paper/68fa5e021e209131ce9de8d1>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:56:16.568Z

Authors: K. Mahesh Krishna

Published: 2024-09-02T03:06:03.000Z

## Abstract

Breakthrough Sparsity Theorem, derived independently by Donoho and Elad \\textit{\[Proc. Natl. Acad. Sci. USA, 2003\]}, Gribonval and Nielsen \\textit{\[IEEE Trans. Inform. Theory, 2003\]} and Fuchs \\textit{\[IEEE Trans. Inform. Theory, 2004\]} says that unique sparse solution to NP-Hard $\\ell\_0$-minimization problem can be obtained using unique solution of P-Type $\\ell\_1$-minimization problem. In this paper, we derive noncommutative version of their result using frames for Hilbert C\*-modules.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2409.09060>)

[PDF](<https://arxiv.org/pdf/2409.09060.pdf>)
