Pith. sign in

REVIEW 2 cited by

Pinned distances of planar sets with low dimension

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

arxiv 2408.00889 v2 pith:X4ECRW5G submitted 2024-08-01 math.CA math.LO

classification math.CAmath.LO
keywords dimensionequationpinnedsetsborelhausdorffmathbbplanar
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regular (i.e., the Hausdorff and packing dimension become closer), our lower bound on the Hausdorff dimension of the pinned distance set improves. Additionally, we prove the existence of small universal sets for pinned distances. In particular, we show that, if a Borel set $X\subseteq\mathbb{R}^2$ is weakly regular ($\dim_H(X) = \dim_P(X)$), and $\dim_H(X) > 1$, then \begin{equation*} \sup\limits_{x\in X}\dim_H(\Delta_x Y) = \min\{\dim_H(Y), 1\} \end{equation*} for every Borel set $Y\subseteq\mathbb{R}^2$. Furthermore, if $X$ is also compact and Ahlfors-David regular, then for every Borel set $Y\subseteq\mathbb{R}^2$, there exists some $x\in X$ such that \begin{equation*} \dim_H(\Delta_x Y) = \min\{\dim_H(Y), 1\}. \end{equation*}

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lebesgue measure of distance sets with regular pins and multi-scale Mizohata-Takeuchi-type estimates

    math.CA 2026-03 unverdicted novelty 8.0 of 10

    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.

  2. Algorithmic Information Bounds for Distances and Orthogonal Projections

    cs.CC 2025-09 conditional novelty 7.0 of 10

    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.

Pith tools