Completeness of sparse, almost integer and finite local complexity sequences of translates in $L^p(\mathbb{R})$

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lev, Nir, Tselishchev, Anton
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917418599710720
author Lev, Nir
Tselishchev, Anton
author_facet Lev, Nir
Tselishchev, Anton
contents A real sequence $Λ= \{λ_n\}_{n=1}^\infty$ is called $p$-generating if there exists a function $g$ whose translates $\{g(x-λ_n)\}_{n=1}^\infty$ span the space $L^p(\mathbb{R})$. While the $p$-generating sets were completely characterized for $p=1$ and $p>2$, the case $1 < p \le 2$ remains not well understood. In this case, both the size and the arithmetic structure of the set play an important role. In the present paper, (i) We show that a $p$-generating set $Λ$ of positive real numbers can be very sparse, namely, the ratios $λ_{n+1} / λ_n$ may tend to $1$ arbitrarily slowly; (ii) We prove that every "almost integer" sequence $Λ$, i.e. satisfying $λ_n = n + α_n$, $0 \neq α_n \to 0$, is $p$-generating; and (iii) We construct $p$-generating sets $Λ$ such that the successive differences $λ_{n+1} - λ_n$ attain only two different positive values. The constructions are, in a sense, sharp: it is well known that $Λ$ cannot be Hadamard lacunary and cannot be contained in any arithmetic progression.
format Preprint
id arxiv_https___arxiv_org_abs_2502_10041
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Completeness of sparse, almost integer and finite local complexity sequences of translates in $L^p(\mathbb{R})$
Lev, Nir
Tselishchev, Anton
Classical Analysis and ODEs
Functional Analysis
42A10, 42A65, 46E30
A real sequence $Λ= \{λ_n\}_{n=1}^\infty$ is called $p$-generating if there exists a function $g$ whose translates $\{g(x-λ_n)\}_{n=1}^\infty$ span the space $L^p(\mathbb{R})$. While the $p$-generating sets were completely characterized for $p=1$ and $p>2$, the case $1 < p \le 2$ remains not well understood. In this case, both the size and the arithmetic structure of the set play an important role. In the present paper, (i) We show that a $p$-generating set $Λ$ of positive real numbers can be very sparse, namely, the ratios $λ_{n+1} / λ_n$ may tend to $1$ arbitrarily slowly; (ii) We prove that every "almost integer" sequence $Λ$, i.e. satisfying $λ_n = n + α_n$, $0 \neq α_n \to 0$, is $p$-generating; and (iii) We construct $p$-generating sets $Λ$ such that the successive differences $λ_{n+1} - λ_n$ attain only two different positive values. The constructions are, in a sense, sharp: it is well known that $Λ$ cannot be Hadamard lacunary and cannot be contained in any arithmetic progression.
title Completeness of sparse, almost integer and finite local complexity sequences of translates in $L^p(\mathbb{R})$
topic Classical Analysis and ODEs
Functional Analysis
42A10, 42A65, 46E30
url https://arxiv.org/abs/2502.10041