Id: palomar/PALOMAR-2026-11-07-000004 Url: https://github.com/lopatto/fourier-formalization-public/tree/eda7f225c99611efa2fd0ee3547ce8ffbb913f2e Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000004-v1.json Repo: https://github.com/lopatto/fourier-formalization-public Tags: math.PR, math.FA, msc:42C10, msc:60B20, msc:94A20 Score: 0 Title: Sparse kernels and necessary sampling for binary Walsh matrices Trust: high Domain: math.PR Source: palomar Authors: Patrick Lopatto Reviews: 0 Subject: math.PR Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-07 Formalized: true Formalizes: title=An Improved Lower Bound for Sparse Reconstruction from Subsampled Walsh Matrices identifier=arXiv:1903.12135v3 relationship=adapts Formalizes: title=Local manuscript of An Improved Lower Bound for Sparse Reconstruction from Subsampled Walsh Matrices identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-07-000004 Finite quantitative sparse-kernel and necessary expected-row bounds for independently subsampled binary Walsh matrices, with uniform asymptotic and recovery/RIP consequences.