Skip to main content
Bounty Ended with 100 reputation awarded by Fiktor
added 2 characters in body; added 12 characters in body
Source Link
André Henriques
  • 43.2k
  • 5
  • 130
  • 264

I have a counterexample in $\mathbb R^2$. Here's how it goes.

Pick two numbers $n$ and $N$, with $N>>n>>1$.
The collection {$v_i$} consists of:

  • $N(n-1)$ times the vector $(\frac{n-2}{n},\frac{1}{N})$$(\frac{n-2}{n},\frac{1}{N(2n-3)})$

  • $N(n-2)$ times the vector $(-\frac{n-1}{n},\frac{1}{N})$$(-\frac{n-1}{n},\frac{1}{N(2n-3)})$

  • The vector $(0,-1)$ once.

The smallest ball into which those vectors can be fit back-to-back has radiusdiameter $\sqrt{5}-\varepsilon$.

I have a counterexample in $\mathbb R^2$. Here's how it goes.

Pick two numbers $n$ and $N$, with $N>>n>>1$.
The collection {$v_i$} consists of:

  • $N(n-1)$ times the vector $(\frac{n-2}{n},\frac{1}{N})$

  • $N(n-2)$ times the vector $(-\frac{n-1}{n},\frac{1}{N})$

  • The vector $(0,-1)$ once.

The smallest ball into which those vectors can be fit back-to-back has radius $\sqrt{5}-\varepsilon$.

I have a counterexample in $\mathbb R^2$. Here's how it goes.

Pick two numbers $n$ and $N$, with $N>>n>>1$.
The collection {$v_i$} consists of:

  • $N(n-1)$ times the vector $(\frac{n-2}{n},\frac{1}{N(2n-3)})$

  • $N(n-2)$ times the vector $(-\frac{n-1}{n},\frac{1}{N(2n-3)})$

  • The vector $(0,-1)$ once.

The smallest ball into which those vectors can be fit back-to-back has diameter $\sqrt{5}-\varepsilon$.

Source Link
André Henriques
  • 43.2k
  • 5
  • 130
  • 264

I have a counterexample in $\mathbb R^2$. Here's how it goes.

Pick two numbers $n$ and $N$, with $N>>n>>1$.
The collection {$v_i$} consists of:

  • $N(n-1)$ times the vector $(\frac{n-2}{n},\frac{1}{N})$

  • $N(n-2)$ times the vector $(-\frac{n-1}{n},\frac{1}{N})$

  • The vector $(0,-1)$ once.

The smallest ball into which those vectors can be fit back-to-back has radius $\sqrt{5}-\varepsilon$.