Falconer's (K, d) distance set conjecture can fail for strictly convex sets K in R^d

DOI10.4171/RMI/1254MaRDI QIDQ2039503zbMATH OpenOpenAlexWikidataFDO

Authors Hindy Drillick, Dimitrios Ntalampekos, Christopher J. Bishop

Publication date 5 July 2021

Published in Revista Matemática Iberoamericana (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/rmi/1254

zbMATH Keywords

convex setsdistance setsFalconer's conjectureHausdorff dimensionpolyhedral norms

Mathematics Subject Classification ID

Hausdorff and packing measures (28A78) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Review text

Summary: For any norm on \(\mathbb{R}^d\) with countably many extreme points, we prove that there is a set \(E \subset \mathbb{R}^d\) of Hausdorff dimension \(d\) whose distance set with respect to this norm has zero linear measure. This was previously known only for norms associated to certain finite polygons in \(\mathbb{R}^2\). Similar examples exist for norms that are very well approximated by polyhedral norms, including some examples where the unit ball is strictly convex and has \(C^1\) boundary.

Recommendations

• On Falconer's distance set conjecture
• K-distance sets, Falconer conjecture, and discrete analogs
• On Falconer's distance set problem in the plane
• Distance sets corresponding to convex bodies
• Sharpness of Falconer’s Estimate and the Single Distance Problem in $$\mathbb{Z}_{q}^{d}$$

Cites work

• K-distance sets, Falconer conjecture, and discrete analogs
• Convex Analysis
• Dimensions of intersections and distance sets for polyhedral norms
• Distance sets of well-distributed planar sets for polygonal norms
• Fractal geometry. Mathematical foundations and applications
• Hausdorff dimension and distance sets
• scientific article; zbMATH DE number 3986300 (Why is no real title available?)
• scientific article; zbMATH DE number 1331721 (Why is no real title available?)
• scientific article; zbMATH DE number 739280 (Why is no real title available?)
• On Falconer's distance set conjecture
• On Falconer's distance set problem in the plane
• On the Erdős distinct distances problem in the plane
• On the Hausdorff dimensions of distance sets
• OPTIMAL SMOOTHING FOR CONVEX POLYTOPES
• Sharp \(L^2\) estimates of the Schrödinger maximal function in higher dimensions
• Weighted restriction estimates and application to Falconer distance set problem
• What is Falconer's Conjecture?

Cited in

(6)

• Every planar set has a conformally removable subset with the same Hausdorff dimension
• On the Hausdorff dimension of the residual set of a packing by smooth curves
• Distances in sparse sets of large Hausdorff dimension
• On the packing dimension of distance sets with respect to C^1 and polyhedral norms
• Distance sets bounds for polyhedral norms via effective dimension
• \({\mathcal C}^m\)-norms on finite sets and \({\mathcal C}^m\) extension

This page was built for publication: Falconer's \((K, d)\) distance set conjecture can fail for strictly convex sets \(K\) in \(\mathbb{R}^d\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039503)