arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.5397math.CA
收藏

关于$R^d$中整环的Nikol'skii不等式

On Nikol'skii inequalities for domains in $R^d$

Z. Ditzian, A. Prymak

摘要:

将讨论各种函数、域和权的Nikol'skii不等式。大部分的工作是致力于一类代数多项式的全次数$n$上的有界凸区域$D$。也就是说,我们研究$σ:= σ(D,d)$,其中\[ \|P\|_{L_q(D)}\le c n^{σ(\frac1p-\frac1q)}\|P\|_{L_p(D)},\quad 0<p\le q\le\infty, \],其中$P$是全次数$n$的多项式。我们使用几何性质的边界$D$确定$σ(D,n)$的援助,比较域之间。在我们的研究中,计算各个域的Christoffel函数的渐近性是至关重要的。这些方法将通过大量的例子来说明,在这些例子中,将明确地计算最佳的$σ(D,n)$。

英文摘要:

Nikol'skii inequalities for various sets of functions, domains and weights will be discussed. Much of the work is dedicated to the class of algebraic polynomials of total degree $n$ on a bounded convex domain $D$. That is, we study $σ:= σ(D,d)$ for which \[ \|P\|_{L_q(D)}\le c n^{σ(\frac1p-\frac1q)}\|P\|_{L_p(D)},\quad 0<p\le q\le\infty, \] where $P$ is a polynomial of total degree $n$. We use geometric properties of the boundary of $D$ to determine $σ(D,n)$ with the aid of comparison between domains. Computing the asymptotics of the Christoffel function of various domains is crucial in our investigation. The methods will be illustrated by the numerous examples in which the optimal $σ(D,n)$ will be computed explicitly.

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

↑