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
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
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
Falconer's conjecture
0 references
Hausdorff dimension
0 references
convex sets
0 references
distance sets
0 references
polyhedral norms
0 references