On Falconer type functions and the distance set problem
Abstract
We study the distance set problem for pairs of compact sets A, B⊂ Rn, n≥ 2. We show that if B is contained in a hyperplane and align* H A+H B>n, align* then the distance set (A,B):=\ x-y: x∈ A, y∈ B\ has positive Lebesgue measure, and the dimensional threshold is sharp. This yields new positive results for Falconer's distance problem in certain regimes, particularly where the best known bounds fail to apply. We further establish Falconer's distance conjecture for certain classes of product sets under additional structural assumptions. Specifically, if A=A1× A2⊂ Rm× Rn-m for some 0≤ m≤ n-1, where A2 is a Salem set, and \[ HA>n2, \] then the distance set (A):=\|x-y|: x,y∈ A\ has positive Lebesgue measure. A key feature of our argument is the interpretation of the original map as a suitable projection. We extend the analysis to a broad class of smooth functions, recovering the sharp result of Koh, Pham, and Shen (J. Funct. Anal. 286 (2024)) for quadratic polynomials in three variables.
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.