English

Realizing trees of configurations in thin sets

Classical Analysis and ODEs 2025-04-22 v3 Combinatorics Metric Geometry

Abstract

Let ϕ(x,y)\phi(x,y) be a continuous function, smooth away from the diagonal, such that, for some α>0\alpha>0, the associated generalized Radon transforms \begin{equation} \label{Radon} R_t^{\phi}f(x)=\int_{\phi(x,y)=t} f(y) \psi(y) d\sigma_{x,t}(y) \end{equation} map L2(Rd)Lα2(Rd)L^2({\mathbb R}^d) \to L^2_{\alpha}({\mathbb R}^d) for all t>0t>0. Let EE be a compact subset of Rd{\mathbb R}^d for some d2d \ge 2, and suppose that the Hausdorff dimension of EE is >dα>d-\alpha. We show that any tree graph TT on k+1k+1 (k1k \ge 1) vertices is \new{stably} realizable in EE, in the sense that \new{for each tt in some open interval} there exist distinct x1,x2,,xk+1Ex^1, x^2, \dots, x^{k+1} \in E %and t>0t>0 such that the ϕ\phi-distance ϕ(xi,xj)=t\phi(x^i, x^j)=t for all pairs (i,j)(i,j) corresponding to the edges of TT. We extend this result to trees whose edges are prescribed by more complicated point configurations, such as congruence classes of triangles.

Keywords

Cite

@article{arxiv.2401.11597,
  title  = {Realizing trees of configurations in thin sets},
  author = {Allan Greenleaf and Alex Iosevich and Krystal Taylor},
  journal= {arXiv preprint arXiv:2401.11597},
  year   = {2025}
}
R2 v1 2026-06-28T14:23:00.184Z