Realizing trees of configurations in thin sets

Abstract

Let φ(x,y) be a continuous function, smooth away from the diagonal, such that, for some α>0, the associated generalized Radon transforms equation Radon Rtφf(x)=∫φ(x,y)=t f(y) (y) dσx,t(y) equation map L2( Rd) L2α( Rd) for all t>0. Let E be a compact subset of Rd for some d 2, and suppose that the Hausdorff dimension of E is >d-α. We show that any tree graph T on k+1 (k 1) vertices is stably realizable in E, in the sense that for each t in some open interval there exist distinct x1, x2, …, xk+1 ∈ E %and t>0 such that the φ-distance φ(xi, xj)=t for all pairs (i,j) corresponding to the edges of T. We extend this result to trees whose edges are prescribed by more complicated point configurations, such as congruence classes of triangles.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…