Euclidean view-obstruction in dimensions eight to ten and the asymptotic deficit
math.MG
Submitted: 2026-11-07
Updated: 2026-11-07
Comments: 24 pages. The source code and exact verification data accompany this paper in a separate archive available at https://zenodo.org/records/24037416
License: http://creativecommons.org/licenses/by/4.0/
The gist: The Euclidean view-obstruction problem asks for the critical radius of balls centered at the half-integer lattice that meet every positive ray from the origin.
Abstract
The Euclidean view-obstruction problem asks for the critical radius of balls centered at the half-integer lattice that meet every positive ray from the origin. Writing Δ n for its square, we determine Δ 8=8/17, Δ 9=1087/1980 and Δ 10=7/11 by computer-assisted proofs using Kahlon's seven-dimensional theorem.The upper bounds combine full-support subspace averaging, projected lattice coverings and exact finite certificates; dimension ten also requires a finite search through short integer relations. Explicit directions attain all three values, including a ten-dimensional direction previously listed by Gritsenko, Skoruppa and Zagier. In arbitrary dimension, we express their theta-block invariant in geometric normalization and derive the known bounds c (n+1) at most n/12 - Δ n at most C 3(n+1), with repeated coordinates allowed throughout. Thus Δ n about n/12, while the deficit tends to infinity more slowly than every positive power of n. The supplementary archive contains the executable verifiers, exact certificates and archived verification records.
Sources
Related papers
- Axis-parallel square packing with an exact formula for optimal packing of seven squares
- The microscopic weighting on a metric space
- Unrectifiable surfaces with intrinsic regularity in Carnot groups
- Monge's transport problem in synthetic Lorentzian spacetimes
- The packing spectrum: interpolation between Hausdorff and packing dimensions
- Quasiconformal uniformization and extension for planar trees