TOPICS
Search

Translative Covering Number


The translative covering number N(K,L) of sets in a vector space is the least number of translates of L whose union contains K:

 N(K,L)=min{m:K subset=  union _(j=1)^m(x_j+L)}.

The centers x_j need not lie in K. When no finite cover exists, the covering number is infinite. For a bounded set in a metric vector space, lnN(K,epsilonB), where B is the unit ball, is a metric entropy at scale epsilon. This covering notion differs from the measure-theoretic entropy of a dynamical system. The metric entropy duality conjecture compares covering numbers of convex bodies and their polar bodies.


See also

Convex Body, Metric Entropy Duality Conjecture, Polar Body

Explore with Wolfram|Alpha

References

Artstein, S.; Milman, V.; and Szarek, S. J. "Duality of Metric Entropy." Ann. Math. 159, 1313-1328, 2004. https://doi.org/10.4007/annals.2004.159.1313.

Cite this as:

Weisstein, Eric W. "Translative Covering Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TranslativeCoveringNumber.html

Subject classifications