Pinned Dot Product Set Estimates
Abstract
We study a variant of the Falconer distance problem for dot products. In particular, for fractal subsets A⊂ Rn and a,x∈ Rn, we study sets of the form \[ xa(A) := \α ∈ R : (a-x)· y= α, for some y∈ A\. \] We discuss some of what is already known to give a picture of the current state of the art, as well as prove some new results and special cases. We obtain lower bounds on the Hausdorff dimension of A to guarantee that ax(A) is large in some quantitative sense for some a∈ A (i.e. xa(A) has large Hausdorff dimension, positive measure, or nonempty interior). Our approach to all three senses of "size" is the same, and we make use of both classical and recent results on projection theory.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.