Covering point-sets with parallel hyperplanes and sparse signal recovery (Lenny Fukshansky, CMC)
Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, CaliforniaLet S be a set of k > n points in n-dimensional Euclidean space. How many parallel hyperplanes are needed to cover it? In fact, it is easy to prove that every such set can be covered by k-n+1 parallel hyperplanes, but do there exist sets that cannot be covered by fewer parallel hyperplanes? We […]