The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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...
We compare various constructions of random proportional quotients of (i.e., with the dimension of the quotient roughly equal to a fixed proportion of m as m → ∞) and show that several of those constructions are equivalent. As a consequence of our approach we conclude that the most natural “geometric” models possess a number of asymptotically extremal properties, some of which were hitherto not known for any model.
Download Results (CSV)