2008/09/13 by Shahaf Nitzan-Hahamov, Nitzan-Hahamov, Shahaf, Alexander Olevskii +2
Computer Science · Engineering · Mathematics · #42C15 #42C30 #Advanced Numerical Analysis Techniques #Classical Analysis and ODEs (math.CA) #Digital Filter Design and Implementation #FOS: Mathematics #Mathematical Analysis and Transform Methods #math.CA #msc:42C15 #msc:42C30
paper · pdf · doi:10.48550/arxiv.0809.2326
10 pages
arxiv created 2008/09/13 · openalex publication_date 2008/09/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We construct a uniformly discrete, and even sparse, sequence of real numbers Λ=\λn\ and a function g in L2(R), such that for every q>2, every function f in L2(R) can be approximated with arbitrary small error by a linear combination ∑ cn g(t-λn) with an lq estimate of the coefficients: ‖\cn\‖lq≤ C(q)‖f‖. This can not be done for q=2, according to [2].