Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Riesz sequences and arithmetic progressions (1404.1796v2)

Published 7 Apr 2014 in math.CA

Abstract: Given a set $\mathcal{S}$ of positive measure on the circle and a set of integers $\Lambda$, one may consider the family of exponentials $E\left(\Lambda\right):=\left{ e{i\lambda t}\right}_{\lambda\in\Lambda}$ and ask whether it is a Riesz sequence in the space $L{2}\left(\mathcal{S}\right)$. We focus on this question in connection with some arithmetic properties of the set of frequencies. Improving a result of Bownik and Speegle, we construct a set $\mathcal{S}$ such that $E\left(\Lambda\right)$ is never a Riesz sequence if $\Lambda$ contains arbitrary long arithmetic progressions of length $N$ and step $\ell=O\left(N{1-\varepsilon}\right)$. On the other hand, we prove that every set $\mathcal{S}$ admits a Riesz sequence $E\left(\Lambda\right)$ such that $\Lambda$ does contain arbitrary long arithmetic progressions of length $N$ and step $\ell=O\left(N\right)$.

Summary

We haven't generated a summary for this paper yet.