Papers
Topics
Authors
Recent
Search
2000 character limit reached

Erdős similarity problem via bi-Lipschitz embedding

Published 3 Dec 2023 in math.CA and math.MG | (2312.01319v1)

Abstract: The Erd\H{o}s similarity conjecture asserted that an infinite set of real numbers cannot be affinely embedded into every measurable set of positive Lebesgue measure. The problem is still open, in particular for all fast decaying sequences. In this paper, we relax the problem to the bi-Lipschitz embedding and obtain some sharp criteria about the bi-Lipschitz Erd\H{o}s similarity problem for strictly decreasing sequences.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.