Unit distance type problems for point configurations in fractal sets

Abstract: The unit distance problem in discrete geometry studies the maximum number of times the unit distance can be achieved in a given point set. In 2015, D. Oberlin and R. Oberlin formulated an analogue of this problem in the continuous setting. In this talk, I'll discuss the problem and some recent results on the extension of it to other point configurations.