6533b81ffe1ef96bd1276ff5

RESEARCH PRODUCT

Explicit Upper Bound for Entropy Numbers

Stanislav Hencl

subject

CombinatoricsApplied MathematicsMaximum entropy probability distributionEmbeddingEntropy (information theory)Min entropyUpper and lower boundsAnalysisEntropy rateQuantum relative entropyJoint quantum entropyMathematics

description

We give an explicit upper bound for the entropy numbers of the embedding I : W r,p(Ql) → C(Ql) where Ql = (−l, l)m ⊂ Rm, r ∈ N, p ∈ (1,∞) and rp > m.

https://doi.org/10.4171/zaa/1195