Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-27T14:13:56.871Z Has data issue: false hasContentIssue false
  • English
  • Français

Localization and Completeness in L2(ℝ)

Published online by Cambridge University Press:  20 November 2018

Victor Olevskii
Victor Olevskii*
Affiliation:
Department of Mathematics, Moscow State University of Instrument Engineering and Computer Science, Stromynka 20, Moscow 107996, Russia. e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We give a necessary and sufficient condition for a sequence to be a localization set for a determining average sampler.

Keywords

42C3094A20localizationcompletenessaverage sampling
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 58 , Issue 1 , 01 March 2015 , pp. 144 - 149
Copyright
Copyright © Canadian Mathematical Society 2015

References

[BM] Beurling, A. and Malliavin, P., On the closure of characters and the zeros of entire functions. Acta Math. 118 (1967) 79–93. http://dx.doi.org/10.1007/BF02392477 Google Scholar
[H] Higgins, J. R., Sampling theory in Fourier and signal analysis: Foundations. Vol. 1, Oxford Science Publications, Clarendon Press, Oxford, 1996.Google Scholar
[NST] Nashed, Z., Sun, Q., and Tang, W.-S., Average sampling in L2. C. R. Acad. Sci. Paris 347 (2009), no. 17–18. 1007–1010. http://dx.doi.org/10.1016/j.crma.2009.07.011 Google Scholar
[O] Olevskii, V., On reconstruction of an average sampled function 1, 2, 3. (Russian) Proc. of the NIT Conf., MGUPI (Moscow Uni. Instr. Eng. Comp. Sci.), 2010–12 Google Scholar