SNShahaf Nitzan-Hahamov
Shahaf Nitzan-Hahamov
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shahaf Nitzan-Hahamov has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Olevskii
Tel Aviv University
4 shared publications - Alexander Ulanovskii
Department of Mathematics and Physics, University of Stavanger, Stavanger, Norway
2 shared publications
Latest Publications
- 22 April 2013
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 280 (1) , 240-247
A few remarks on sampling of signals with small spectrum
Given a bounded set S of small measure, we discuss the existence of sampling sequences for the Paley-Wiener space PW S , which have both densities and sampling bounds close to the optimal ones.
- 22 April 2013
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 280 (1) , 240-247
A few remarks on sampling of signals with small spectrum
Given a bounded set S of small measure, we discuss the existence of sampling sequences for the Paley-Wiener space PW S , which have both densities and sampling bounds close to the optimal ones.
- Open Access
A few remarks on sampling of signals with small spectrum
Given a set $S$ of small measure, we discuss existence of sampling sequences for the Paley-Wiener space $PW_S$, which have both densities and sampling bounds close to the optimal ones.Open AccessA few remarks on sampling of signals with small spectrum
Given a set $S$ of small measure, we discuss existence of sampling sequences for the Paley-Wiener space $PW_S$, which have both densities and sampling bounds close to the optimal ones. - Open Access
Frame-type families of translates
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].Open AccessFrame-type families of translates
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]. - 1 March 2007
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 158 (1) , 205-215
Sparse exponential systems: Completeness with estimates
- 1 March 2007
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 158 (1) , 205-215
Sparse exponential systems: Completeness with estimates