arXiv (All)
open access
The higher-dimensional Shepp problem: an exact criterion for random ball coverings of tori
We solve the Euclidean-ball case of the higher-dimensional Shepp covering problem. More precisely, we give an exact criterion for full limsup coverage of the $d$-dimensional torus, $d\ge 2$, by independently centered Euclidean balls with an arbitrary decreasing sequence of radii. Let $X_1,X_2,\ldots
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Two-sided linear hashing and quadratic density bounds for smooth lattice coverings#1034115
- Cover times and ranges of elephant random walks#1123642
- Dimension-free estimates for full discrete maximal functions associated with Euclidean balls and spheres#997753
- Uniform integrability of the distance to the nearest leaf in random trees#1129301
- Nonparametric Regression on Fixed-Cardinality Subsets:Minimax Risk and Random-Design Effects#1109580
Record · ID 822552
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive