2000 character limit reached
Infinite constant gap length trees in products of thick Cantor sets
Published 19 Nov 2022 in math.CA | (2211.10750v2)
Abstract: We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to be countably infinite, which further distinguishes this work from previous results on patterns in fractal sets. This builds on the authors' previous work on graphs and distance sets of products of Cantor sets of sufficient Newhouse thickness.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.