Doubling dimension of a Euclidean space

2012-06-27T13:54:43Z

The doubling dimension of a metric space $X$ is the smallest positive integer $k$ such that every ball of $X$ can be covered by $2^k$ balls of half the radius.

It is well known that the doubling dimension $d(n)$ of the Euclidean space $\mathbb R^n$ is $O(n)$, which means that there is a constant $C$ such that for large $n$ one has $d(n)\leq Cn$. A posteriori, I can find a new constant $D$ that works for all $n$. I would like to have an explicit description of this new constant. In other words,

Question: What explicit and possibly nice and small constant $D>0$ would guarantee that $d(n)\leq Dn$, for all $n$?

Edit. As observed by Igor Rivin, $D=\log 2$ should be good for $n\geq7$, by a theorem of Verger-Gaugry. Any idea for all $n$? I have to clarify that at the moment I am not interested in the best possible constant, but in some good-looking constant, something to make aesthetically pleasant a certain formula that I found out.

Thank you in advance,

Valerio

Answer by Igor Rivin for Doubling dimension of a Euclidean space

2012-06-27T14:04:25Z

As shown in this paper,Theorem 1.2, $D \leq \log 2.$ I remark that this paper came up in my answer to this question, and there is a bug for small $n$ ($n < 7$), but the author's interest was apparently similar to yours, so the large $n$ results should be correct. (the paper is: "Covering a Ball with Smaller Equal Balls in $\mathbb{R}^n," by Jean-Louis Verger-Gaugry)

Doubling dimension of a Euclidean space - MathOverflow

Doubling dimension of a Euclidean space

Answer by Igor Rivin for Doubling dimension of a Euclidean space