Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cubature formulas and Sobolev inequalities

Published 15 Dec 2020 in math.CO and math.CA | (2012.08109v1)

Abstract: We study a problem in the theory of cubature formulas on the sphere: given $\theta \in (0, 1)$, determine the infimum of $|\nu|\theta = \sum{i = 1}n \nu_i\theta$ over cubature formulas $\nu$ of strength $t$, where $\nu_i$ are the weights of the formula $\nu$. This problem, which generalizes the classical problem of bounding the minimal cardinality of a cubature formula -- the case $\theta = 0$ -- was introduced in recent work of Hang and Wang (arXiv:2010.10654), who showed the problem to be related to optimal constants in Sobolev inequalities. Using the elementary theory of reproducing kernel Hilbert spaces on $S{n - 1}$, we extend the best known upper and lower bounds for the minimal cardinality of strength-$t$ cubature formulas to bounds for the infimum of $|\cdot|\theta$ for any $\theta \in (0, 1)$. In particular, we completely characterize the cubature measures of strength $3$ minimizing $|\cdot|\theta$, showing that these are precisely the tight spherical $3$-designs.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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 (1)

Collections

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