Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 152 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 32 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 204 tok/s Pro
GPT OSS 120B 429 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

On Nikol'skii inequalities for domains in $R^d$ (1409.5397v2)

Published 18 Sep 2014 in math.CA

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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