All Questions
Tagged with metric-spaces packing-and-covering
11 questions
4
votes
1
answer
97
views
Inner regularity property of covering number of metric spaces
Let $(X,d)$ be a complete metric space and $n\in\mathbb N$. Suppose that every finite subset $F\subset X$ can be covered by $n$ closed balls of $X$ (that is, $N(Y,d,1)\le n$, in terms of covering ...
CommunityBot
- 1
8
votes
0
answers
149
views
Do the $\ell^{\infty}$ and $\ell^1$ norms yield minimal doubling constants amongst all norms on $\mathbb{R}^n$?
Setting:
Let $X:=\mathbb{R}^n$ for some positive integer $n$. For each $1\le p\le \infty$ let $d_p$ denote the metric induced by the $\ell^p_n$ norm thereon.
Note that, the doubling constant of a ...
- 5,405
0
votes
0
answers
65
views
Random covering on rectangles
Let $\mathrm{Rect}$ denote the class of axis-parallel rectangles $r: \mathbb{R}^2 \to \{0,1\}$, assigning $1$ if the point is inside the rectangle and $0$ otherwise. Let $\mathcal{D}$ be a ...
- 159
13
votes
0
answers
818
views
Covering number estimates for Hölder balls
Let $\alpha \in (0,1]$, $r>0$ and $L>0$, and positive intwgers $n$ and $m$. The Arzela-Ascoli Theorem guarantees that the set $X(\alpha,L,r)$ of $f:[-1,1]^n\rightarrow [-r,r]^m$ with $\alpha$-...
- 5,405
3
votes
1
answer
132
views
If $X,X'$ have the same $\varepsilon$-packing numbers and $f:X \to X'$ surjective $1$-Lipschitz, then $f$ is an isometry
Let $(X, d)$ be a compact metric space.
We say that $\{x_1, \cdots, x_n\} \subseteq X$ is an $\varepsilon$-covering of $X$ if for any $x \in X$, there exists $i \in \{1, \ldots, n\}$ such that $d(x, ...
- 45k
2
votes
1
answer
139
views
Are two metric spaces isometric if they have the same $\varepsilon$-covering and $\varepsilon$-packing numbers for all $\varepsilon>0$?
Let $(X, d)$ be a compact metric space.
We say that $\{x_1, \cdots, x_n\} \subseteq X$ is an $\varepsilon$-covering of $X$ if for any $x \in X$, there exists $i \in \{1, \ldots, n\}$ such that $d(x, ...
- 109k
2
votes
1
answer
259
views
Are two metric spaces isometric if they have the same $\varepsilon$-covering numbers for all $\varepsilon>0$?
Let $(E, d)$ be a metric space. For $\varepsilon>0$, we define two notions of $\varepsilon$-covering number as follows, i.e.,
$N_\varepsilon^o (E)$ is the smallest number of open balls whose radii ...
- 835
1
vote
0
answers
449
views
Bound on covering number of Lipschitz functions – missing part in proofs of Kolmogorov et al
Given a metric space $(\mathcal{X},\rho)$ and $\mathcal{A}\subset\mathcal{X}$ totally bounded, i.e. $\mathcal{A}$ has a finite $\varepsilon$-covering for any $\varepsilon>0$. Consider $\...
- 63.9k
3
votes
0
answers
171
views
Covering number $C^k$-balls in $C(\mathbb{R}^n)$
Fix a positive integer $n$ and and an non-negative integer $k$. The Arzela-Ascoli theorem guarantees that for a given positive integer $k$ and a given $L>0$ the set
$$
Ball_{C^{k,1}([0,1]^n)}(0,L)
...
- 5,405
1
vote
1
answer
158
views
Effect of snowflaking on doubling constants
This question is related to this one. Let $(X,d)$ be a metric space, let $\epsilon\in [0,1)$ and consider the snowflake $(X,d^{1-\epsilon})$. Suppose that $(X,d)$ has a finite doubling constant, ...
- 42.8k
10
votes
1
answer
560
views
Are packing-homogeneous spaces homogeneous?
Given a metric space (M,d) define the packing function P(x,R,r) to be the maximum number of non-intersecting balls of radius r with centers in the ball B(x,R). Let’s call M packing-homogeneous if the ...
