Estimates of covering numbers (Q1177063)

The authors introduce a joint generalization of the entropy and other \(s\)-numbers, the \(s\)-covering numbers. The \(s\)-numbers of interest are the approximation-, Gelfand- and Tikhomirov-numbers. The authors prove various inequalities between the \(s\)-covering numbers and other \(s\)- numbers. Some of the results rely on Pisier's version of Milman's ellipsoid. The paper also contains inequalities between \(s\)-covering numbers, Gaussian averages and Rademacher averages.