On Nikol'skii inequalities for domains in Rd
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 σ:= σ(D,d) for which \[ \|P\|Lq(D) c nσ(1p-1q)\|P\|Lp(D), 0<p q∞, \] 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.