Let P d n be the space of real algebraic polynomials of d variables and degree at most n, K ⊂ R d a compact set, ‖ p‖ K := sup x∈K | p(x)| the usual supremum norm on K , and car d(Y ) the cardinality of a finite set Y . A family of sets Y = {Y n ⊂ K , n ∈ N} is called an admissible mesh in K if there exists a constant c 1 > 0 depending only on K such thatwhere the cardinality of Y n grows at most polynomially. If car d(Y n ) ≤ c 2 n d , n ∈ N with some c 2 > 0 depending only on K then we say that the admissible mesh is optimal. This notion of admissible meshes is related to norming sets which are widely used in the literature. In this paper we present some general families of sets possessing admissible meshes which are optimal or near optimal in the sense that the cardinality of sets Y n does not grow too fast. In particular, it will be shown that graph domains bounded by polynomial graphs, convex polytopes and star like sets with C 2 boundary possess optimal admissible meshes. In addition, graph domains with piecewise analytic boundary and any convex sets in R 2 possess almost optimal admissible meshes in the sense that the cardinality of admissible meshes is larger than optimal only by a log n factor.
Abstract. We establish asymptotics for Christoffel functions associated with multivariate orthogonal polynomials. The underlying measures are assumed to be regular on a suitable domain -in particular this is true if they are positive a.e. on a compact set that admits analytic parametrization. As a consequence, we obtain asymptotics for Christoffel functions for measures on the ball and simplex, under far more general conditions than previously known. As another consequence, we establish universality type limits in the bulk in a variety of settings.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.