REVIEW 2 cited by
Dimension of Pinned Distance Sets for Semi-Regular Sets
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We prove that if $E\subseteq \R^2$ is analytic and $1<d < \dim_H(E)$, there are ``many'' points $x\in E$ such that the Hausdorff dimension of the pinned distance set $\Delta_x E$ is at least $d\left(1 - \frac{\left(D-1\right)\left(D-d\right)}{2D^2+\left(2-4d\right)D+d^2+d-2}\right)$, where $D = \dim_P(E)$. In particular, we prove that $\dim_H(\Delta_x E) \geq \frac{d(d-4)}{d-5}$ for these $x$, which gives the best known lower bound for this problem when $d \in (1, 5-\sqrt{15})$. We also prove that there exists some $x\in E$ such that the packing dimension of $\Delta_x E$ is at least $\frac{12 -\sqrt{2}}{8\sqrt{2}}$. Moreover, whenever the packing dimension of $E$ is sufficiently close to the Hausdorff dimension of $E$, we show the pinned distance set $\Delta_x E$ has full Hausdorff dimension for many points $x\in E$; in particular the condition is that $D<\frac{(3+\sqrt{5})d-1-\sqrt{5}}{2}$. We also consider the pinned distance problem between two sets $X, Y\subseteq \R^2$, both of Hausdorff dimension greater than 1. We show that if either $X$ or $Y$ has equal Hausdorff and packing dimensions, the pinned distance $\Delta_x Y$ has full Hausdorff dimension for many points $x\in X$.
Forward citations
Cited by 2 Pith papers
-
Lebesgue measure of distance sets with regular pins and multi-scale Mizohata-Takeuchi-type estimates
Under dim_H E >1, dim_H E + dim_H F >2 and F regular (equal Hausdorff and packing dimensions), there exists y in F such that the pinned distance set Δ_y(E) has positive Lebesgue measure.
-
Algorithmic Information Bounds for Distances and Orthogonal Projections
A new proof technique shows distances and orthogonal projections retain at least half of a planar point's Kolmogorov complexity, improving pinned distance dimension bounds to 3/4 s and generalizing Bourgain's theorem.
Discussion (0). Continue with ORCID to comment.