Pith. sign in

REVIEW 1 cited by

Small union with large set of 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 1701.02762 v1 pith:7BWVGZW2 submitted 2017-01-10 math.MG math.CA

classification math.MGmath.CA
keywords mathbbscaledcenteredcopiesoriginwhenallowaround
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Let $T\subset{\mathbb R}^n$ be a fixed set. By a scaled copy of $T$ around $x\in{\mathbb R}^n$ we mean a set of the form $x+rT$ for some $r>0$. In this survey paper we study results about the following type of problems: How small can a set be if it contains a scaled copy of $T$ around every point of a set of given size? We will consider the cases when $T$ is circle or sphere centered at the origin, Cantor set in ${\mathbb R}$, the boundary of a square centered at the origin, or more generally the $k$-skeleton ($0\le k<n$) of an $n$-dimensional cube centered at the origin or the $k$-skeleton of a more general polytope of ${\mathbb R}^n$. We also study the case when we allow not only scaled copies but also scaled and rotated copies and also the case when we allow only rotated copies.

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