Metric Entropy of Homogeneous Spaces
For a precompact subset K of a metric space and ε > 0, the covering number N(K,ε) is defined as the smallest number of balls of radius ε whose union covers K. Knowledge of the metric entropy, i.e., the asymptotic behaviour of covering numbers for (families of) metric spaces is important in many areas of mathematics (geometry, functional analysis, probability, coding theory, to name a few). In this paper we give asymptotically correct estimates for covering numbers for a large class of homogeneous...