Finite Point Configurations and the Regular Value Theorem in a Fractal setting
Abstract
In this article, we study two problems concerning the size of the set of finite point configurations generated by a compact set . The first problem concerns how the Lebesgue measure or the Hausdorff dimension of the finite point configuration set depends on that of . In particular, we show that if a planar set has dimension exceeding , then there exists a point so that for each integer , the set of "-chains" with initial point at has positive Lebesgue measure. The second problem is a continuous analogue of the Erd\H{o}s unit distance problem, which aims to determine the maximum number of times a point configuration with prescribed gaps can appear in . For instance, given a triangle with prescribed sides and given a sufficiently regular planar set with Hausdorff dimension no less than , we show that the dimension of the set of vertices in forming said triangle does not exceed . In addition to the Euclidean norm, we consider more general distances given by functions satisfying the so-called Phong-Stein rotational curvature condition. We also explore a number of examples to demonstrate the extent to which our results are sharp.
Cite
@article{arxiv.2005.12233,
title = {Finite Point Configurations and the Regular Value Theorem in a Fractal setting},
author = {Yumeng Ou and Krystal Taylor},
journal= {arXiv preprint arXiv:2005.12233},
year = {2020}
}