A note on Hornich's problem

DOI10.1007/S000130050313MaRDI QIDQ1291136zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 12 December 1999

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000130050313

zbMATH Keywords

Dirichlet approximation theoremHornich problemnonoverlapping unit spheresupper bound

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Review text

An upper bound is given for Hornich's problem, namely to determine the smallest number of nonoverlapping unit spheres which can block all the light rays starting from the center of a fixed one. The Dirichlet approximation theorem is applied.

Recommendations

• On a problem of Hornik
• Queries
• scientific article; zbMATH DE number 3505096
• Notes on a problem of H. Cohn
• A NOTE ON A PROBLEM OF HAYMAN
• scientific article; zbMATH DE number 962286
• A note on a problem of Hilliker and Straus
• A note on the Bateman-Horn conjecture
• scientific article; zbMATH DE number 1867943
• On the Schur-Horn problem

Cited in

(8)

• A note on the Bateman-Horn conjecture
• On Horn's problem and its volume function
• From deep holes to free planes
• scientific article; zbMATH DE number 3863550 (Why is no real title available?)
• scientific article; zbMATH DE number 3505096 (Why is no real title available?)
• Segments in ball packings
• scientific article; zbMATH DE number 6151289 (Why is no real title available?)
• Candle in the woods: asymptotic bounds on minimum blocking sets

This page was built for publication: A note on Hornich's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291136)