Covering point-sets with parallel hyperplanes and sparse signal recovery

DOI10.1007/s00454-022-00375-yOpenAlexW2995237445MaRDI QIDQ2689251

Alexander Hsu, Lenny Fukshansky

Publication date: 9 March 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.10138

zbMATH Keywords

coveringhyperplanesparse recoverysensing matrixTarski's plank probleminteger cube

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Special matrices (15B99)

Related Items (3)

Sparse recovery properties of discrete random matrices ⋮ On a new absolute version of Siegel's lemma ⋮ On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• On the recovery of an integer vector from linear measurements
• Covering the cube by affine hyperplanes
• Polarities and \(2k\)-cycle-free graphs
• Explicit construction of graphs with an arbitrary large girth and of large size
• An algebraic perspective on integer sparse recovery
• An extremal problem for integer sparse recovery
• Extremal problems for cycles in graphs
• A new series of dense graphs of high girth
• Covering lattice points by subspaces and counting point-hyperplane incidences
• A Solution of the "Plank Problem"

This page was built for publication: Covering point-sets with parallel hyperplanes and sparse signal recovery