Tagged Questions

Let $D\subset \mathbb{F}_2^n$ with $D=-D$ and $0\in D$. Write $k D$ for the set of all sums of $k$ (not necessarily distinct) elements of $D$. (This is the "ball" in the title.)
Now let $d(g,h)$ be ...

I have come across the need to know a bound on a certain curious quantity: the covering number of the range of a continuous function $f: D \rightarrow \mathbb{R}^n$, where $D \subseteq \mathbb{R}^m$. ...

What's the current state of knowledge regarding packings of spheres in $n$-space that minimize the supremum of the sizes of the holes? This notion of tightness is more rigid than asymptotic density. I ...

Suppose one has $k$ unit-radius disks, and the goal is to hide them inside
a disk of radius $R \gg k$.
The detection probes are rays along a line.
(Think of the disks as tumor cells, and the rays as ...

I am currently researching discrete geometry and I am in need of an upper bound on a generalized kissing number in 3-dimensions dependent upon a parameter $\eta$ which is the radii of spheres touching ...

There has been much work done on the kissing number problem (of determining the greatest number of congruent spheres which can touch a single sphere in a packing) in Euclidean space for dimensions $1$ ...

I'm working on sphere packings. When I write, I'm confused with basic definitions. I'm hesitating between the terms "sphere", "ball" or "oriented sphere".
For example, on the wikipedia page of circle ...

What is the maximum number of spheres that can be placed in 3D such that all inter-touch?
One can of course place four unit spheres tetrahedrally and then add a smaller sphere in the
middle, so this ...

Hi everyone.
I need to pick a set of 65 points p(x,y,z) in a 3D space of 274625 points; as
the set picked should provide the maximum possible minimum Hamming distance.
(Consider the Hamming bound for ...

Suppose unit-radius disks fall vertically from $y=+\infty$,
one by one, and create a random jumble of disks above the $x$-axis.
When a falling disk hits another, it stops and sticks there.
Otherwise, ...

I wrote a program that numerically searches for lattices in $\mathbb{R}^d$ with high sphere packing densities. As I have been running the program, it has been able to find, in addition to well-known ...

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented
"in such a way that its vertices correspond to disjoint disks, which touch if and only if
the corresponding vertices ...

Computing the volume of a sphere is straightforward 4/3*pi*R^3
As is the volume of a rectangular space length*width*height (e.g. 10*10*6)
How might I go about determining how many spheres would fit ...