Compactness of Fourier Concentration Operators

Abstract We present a sufficient condition on sets E and F in $${\mathbb R}^d$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>d</mml:mi> </mml:msup> </mml:math> to ensure compactness of Fourier concentration operators by introducing the notion of sets which are very thin at infinity. We are able to show that if the sets E and F are both very thin at infinity, then the associated Fourier concentration operator is compact on $$L^2({\mathbb R}^d)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mi>L</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>d</mml:mi> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> . The proof relies on a combination of the Logvinenko-Sereda uncertainty principle together with an uncertainty principle due to Shubin, Vakilian and Wolff. This provides a partial answer to a question posed by Katsnelson and Machluf on truncated Fourier operators.

Authors

Institutions

Publication Details

Journal
Journal of Fourier Analysis and Applications
Published
2025-09-18
DOI
https://doi.org/10.1007/s00041-025-10195-2
Primary Topic
Mathematical Analysis and Transform Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Compactness of Fourier Concentration Operators

Helge J. Samuelsen
Journal of Fourier Analysis and Applications
Mathematical Analysis and Transform Methods
article

Compactness of Fourier Concentration Operators

Helge J. Samuelsen
article en

Abstract

Abstract We present a sufficient condition on sets E and F in $${\mathbb R}^d$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>d</mml:mi> </mml:msup> </mml:math> to ensure compactness of Fourier concentration operators by introducing the notion of sets which are very thin at infinity. We are able to show that if the sets E and F are both very thin at infinity, then the associated Fourier concentration operator is compact on $$L^2({\mathbb R}^d)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mi>L</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>d</mml:mi> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> . The proof relies on a combination of the Logvinenko-Sereda uncertainty principle together with an uncertainty principle due to Shubin, Vakilian and Wolff. This provides a partial answer to a question posed by Katsnelson and Machluf on truncated Fourier operators.

Journal of Fourier Analysis and ApplicationsVol. 31(5)
Norwegian University of Science and Technology (NO)
National Science Foundation, Norges Teknisk-Naturvitenskapelige Universitet, St. Olavs Hospital Universitetssykehuset i Trondheim
Openalex Percentile: Top 64%
Mathematical Analysis and Transform Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Compactness of Fourier Concentration Operators — Helge J. Samuelsen · Journal of Fourier Analysis and Applications (2025) | TGRS Research Map | TGRS