Page not found
This question was removed from MathOverflow for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Expected number of steps for a discrete random walk to visit every point on an N-dimensional rectangular lattice
- An exact counting solution for the number of points within a circle of radius $r$ centered on a lattice point in a $A_2$ hexagonal lattice
- Blowing up spheres in a face centered cubic (fcc) packing geometry just enough to cover the volume of the lattice
- Techniques for showing optimality of given packing
- For a 3D Apollonian packing, do we really know that the Hausdorff dimension of the complement is approximated by the growth rate of curvature?
- Packing bounds for sumsets, or, very discrete balls
- Extremal functions for the 'packing density in dimension one'
- Prospects for deep learning of non-lattice sphere packings
- Simple non-asymptotic upper-bound for packing number of a hamming cube
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.