A seemingly random cloud of fractal dust is guaranteed to contain a perfect geometric pattern if it reaches a certain density.
Fractal sets are usually seen as fragmented and chaotic shapes with no clear structure. This mathematical proof shows that if a fractal on a line is thick enough, it must contain three points that fit a specific curved pattern. No matter how much you break up or randomize the set, this hidden order is mathematically impossible to avoid. It reveals a deep link between the density of a set and the geometry it can support. This finding has implications for everything from signal processing to the way crystals grow in nature.
A curved three-point pattern problem for fractal sets on the real line
arXiv · 2604.25561
We study the occurrence of curved three-point configurations in fractal subsets of the real line. We prove that if \(E \subset [0,1]\) is a compact set with sufficiently large Hausdorff dimension, then \(E\) contains a curved three-point progression associated with a broad class of nonlinear functions.Our approach can also show the existence of the curved three-point pattern under the assumption that the Hausdorff content of \(E\) is bounded away from zero. The class of functions includes, in ad