Pith. sign in

REVIEW 1 cited by

Squares and their centers

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 1408.1029 v2 pith:7VIYXAUX submitted 2014-08-05 math.MG math.CAmath.CO

classification math.MGmath.CAmath.CO
keywords dimensionpackingaxes-parallelboundarycentercenterscontainsevery
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We study the relationship between the sizes of two sets $B, S\subset\mathbb{R}^2$ when $B$ contains either the whole boundary, or the four vertices, of a square with axes-parallel sides and center in every point of $S$, where size refers to one of cardinality, Hausdorff dimension, packing dimension, or upper or lower box dimension. Perhaps surprinsingly, the results vary depending on the notion of size under consideration. For example, we construct a compact set $B$ of Hausdorff dimension $1$ which contains the boundary of an axes-parallel square with center in every point $[0,1]^2$, but prove that such a $B$ must have packing and lower box dimension at least $\tfrac{7}{4}$, and show by example that this is sharp. For more general sets of centers, the answers for packing and box counting dimensions also differ. These problems are inspired by the analogous problems for circles that were investigated by Bourgain, Marstrand and Wolff, among others.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. The Endpoint Cardinality of Discrete Cube Skeleta

    math.CO 2026-07 accept novelty 7.0 of 10

    For each fixed 0≤k<n, the minimum lattice set containing a filled k-skeleton about every one of N centers is Θ(N^{1-(n-k)/(2n^2)}), closing the endpoint lower bound.

Pith tools