2000 character limit reached
Erdős similarity problem via bi-Lipschitz embedding (2312.01319v1)
Published 3 Dec 2023 in math.CA and math.MG
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.