Optimal polynomial meshes exist on any multivariate convex domain
Feng Dai, Andriy Prymak

TL;DR
This paper proves that optimal polynomial meshes can be constructed for any convex domain in multi-dimensional space, confirming a longstanding conjecture and advancing approximation theory.
Contribution
It establishes the existence of optimal polynomial meshes on all convex bodies in , resolving a conjecture by A. Kroo.
Findings
Optimal polynomial meshes exist for all convex bodies in .
The result confirms a conjecture by A. Kroo.
Provides a foundation for approximation on convex domains.
Abstract
We show that optimal polynomial meshes exist for every convex body in , confirming a conjecture by A. Kroo.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometry and complex manifolds · Point processes and geometric inequalities · Advanced Differential Equations and Dynamical Systems
