Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 18 Sep 2014 in math.CA | (1409.5397v2)

Abstract: 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 $\sigma:= \sigma(D,d)$ for which [ |P|{L_q(D)}\le c n{\sigma(\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 $\sigma(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 $\sigma(D,n)$ will be computed explicitly.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.