arXiv (OAI Expanded)
open access
Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels
We establish a potential-theoretic sufficient condition for a compact subset of the real line to admit an optimal polynomial mesh. The criterion bounds the cardinality of a norming set by a linear term in the polynomial degree plus the number of connected components of a Green sublevel at height $α/
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels#780921
- A combinatorial approach to point-flat incidences over finite fields#1118077
- A set of points with optimal $L^2$ spherical cap discrepancy#1064252
- Greedy Packing of Nested Rings: Placement Rules, a Golden Counterexample, and a Tribonacci Floor#1123274
- Optimal discrepancy for triangles#1155310
Record · ID 779546
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive