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

TL;DR
This paper investigates the properties of sparse and almost integer sequences that generate the entire space of $L^p( )$ through their translates, revealing new constructions and limitations for such sets.
Contribution
It demonstrates that $p$-generating sets can be arbitrarily sparse, includes all almost integer sequences, and constructs sets with limited difference values, extending understanding for $1<p extless 2$.
Findings
Sparse $p$-generating sets with ratios tending to 1 are possible.
All almost integer sequences are $p$-generating.
Constructed $p$-generating sets with only two difference values.
Abstract
A real sequence is called -generating if there exists a function whose translates span the space . While the -generating sets were completely characterized for and , the case 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 -generating set of positive real numbers can be very sparse, namely, the ratios may tend to arbitrarily slowly; (ii) We prove that every "almost integer" sequence , i.e. satisfying , , is -generating; and (iii) We construct -generating sets such that the successive differences attain only…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
