arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9302207math.FA
收藏

How many vectors are needed to compute (p,q)-summing norms?

M. Defant, Marius Junge

英文摘要:

We will show that for $q<p$ there exists an $\al < \infty$ such that \[ π_{pq}(T) \pl \le c_{pq} π_{pq}^{[n^α]}(T) \mbox{for all $T$ of rank $n$.}\] Such a polynomial number is only possible if $q=2$ or $q<p$. Furthermore, the growth rate is linear if $q=2$ or $\frac{1}{q}-\frac{1}{p}>\frac{1}{2}$. Unless $\frac{1}{q}-\frac{1}{p}=\frac{1}{2}$ this is also a necessary condition .

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑