Mathematics > Classical Analysis and ODEs
[Submitted on 7 Jul 2022 (v1), last revised 31 Oct 2022 (this version, v3)]
Title:On a topological Erdős similarity problem
View PDFAbstract:A pattern is called universal in another collection of sets, when every set in the collection contains some linear and translated copy of the original pattern. Paul Erdős proposed a conjecture that no infinite set is universal in the collection of sets with positive measure. This paper explores an analogous problem in the topological setting. Instead of sets with positive measure, we investigate the collection of dense $G_{\delta}$ sets and in the collection of generic sets (dense $G_{\delta}$ and complement has Lebesgue measure zero). We refer to such pattern as topologically universal and generically universal respectively. It is easy to show that any countable set is topologically universal, while any set containing an interior cannot be topologically universal. In this paper, we will show that Cantor sets on ${\mathbb R}^d$ are not topologically universal and Cantor sets with positive Newhouse thickness on ${\mathbb R}^1$ are not generically universal. This gives a positive partial answer to a question by Svetic concerning the Erdős similarity problem on Cantor sets. Moreover, we also obtain a higher dimensional generalization of the generic universality problem.
Submission history
From: Chun-Kit Lai [view email][v1] Thu, 7 Jul 2022 04:23:26 UTC (13 KB)
[v2] Thu, 4 Aug 2022 07:16:43 UTC (16 KB)
[v3] Mon, 31 Oct 2022 17:20:53 UTC (18 KB)
Current browse context:
math.CA
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.