Falconer's \((K, d)\) distance set conjecture can fail for strictly convex sets \(K\) in \(\mathbb{R}^d\) (Q2039503): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Christopher J. Bishop / rank
Normal rank
 
Property / author
 
Property / author: Christopher J. Bishop / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113691956 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4171/rmi/1254 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3127876859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hausdorff dimension and distance sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted restriction estimates and application to Falconer distance set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp \(L^2\) estimates of the Schrödinger maximal function in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Falconer's distance set conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hausdorff dimensions of distance sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimensions of intersections and distance sets for polyhedral norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2872212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL SMOOTHING FOR CONVEX POLYTOPES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Falconer's distance set problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős distinct distances problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is Falconer's Conjecture? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3749848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance sets of well-distributed planar sets for polygonal norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261672 / rank
 
Normal rank

Latest revision as of 03:53, 26 July 2024

scientific article
Language Label Description Also known as
English
Falconer's \((K, d)\) distance set conjecture can fail for strictly convex sets \(K\) in \(\mathbb{R}^d\)
scientific article

    Statements

    Falconer's \((K, d)\) distance set conjecture can fail for strictly convex sets \(K\) in \(\mathbb{R}^d\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 July 2021
    0 references
    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.
    0 references
    0 references
    Falconer's conjecture
    0 references
    Hausdorff dimension
    0 references
    convex sets
    0 references
    distance sets
    0 references
    polyhedral norms
    0 references
    0 references
    0 references