pith. sign in

arxiv: 0809.2326 · v1 · submitted 2008-09-13 · 🧮 math.CA

Frame-type families of translates

classification 🧮 math.CA
keywords lambdaeveryfunctionaccordingapproximatedarbitrarycoefficientscombination
0
0 comments X
read the original abstract

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a linear combination $\sum c_n g(t-\lambda_n)$ with an $l_q$ estimate of the coefficients: \|\{c_n\}\|_{l_q}\leq C(q)\|f\|. This can not be done for q=2, according to [2].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.