New answers tagged packing-and-covering
5
votes
How many non-orthogonal vectors fit into a complex vector space?
Jan Nienhaus's answer treats the case $\epsilon<\frac{1}{D}$. Here's a generalization that works whenever $\epsilon<\frac{1}{\sqrt{D}}$:
$$ N \leq \frac{1-\epsilon^2}{1 - D\epsilon^2}\cdot D. $$
...
6
votes
How many non-orthogonal vectors fit into a complex vector space?
While volume comparison will give you a rough estimate for any value of $\varepsilon$, the sharp estimate is that, for small enough $\varepsilon$, $N\le D$.
One way to get this is by showing that your ...
4
votes
How many non-orthogonal vectors fit into a complex vector space?
This is a packing problem in the complex projective space $CP^{D-1}$ of dimension $D-1$ with its Fubini-Study metric. Since the volume of $CP^{D-1}$ is known, you can use the same argument by ...
Top 50 recent answers are included
Related Tags
packing-and-covering × 196mg.metric-geometry × 86
discrete-geometry × 68
co.combinatorics × 30
sphere-packing × 21
pr.probability × 19
reference-request × 11
circle-packing × 10
graph-theory × 9
fa.functional-analysis × 8
stochastic-processes × 8
lattices × 8
metric-spaces × 8
tiling × 8
nt.number-theory × 7
st.statistics × 7
computational-geometry × 7
real-analysis × 6
plane-geometry × 6
combinatorial-optimization × 6
learning-theory × 6
dg.differential-geometry × 5
mp.mathematical-physics × 5
riemannian-geometry × 4
measure-theory × 4