arXiv (OAI Expanded)
open access
Erdős's Robust Polynomial Interpolation Problem: the Optimal Exponential Scale
We determine the optimal exponential scale in Erdős's robust polynomial interpolation problem and identify the leading exponential coefficient for Chebyshev--Lobatto grids. Given $C>0$ and $0\leρ<1$, put $H=C/(1-ρ)$. We prove that every configuration of $n\ge n_0$ nodes in $[-1,1]$ admits sign data
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
- Simple critical zeros and distinct zeros of the Riemann zeta-function in short intervals#985328
- A Monte Carlo Estimator for an Isolated Polynomial Zero via Contour Integral Representations#1157433
- Almost $k$-th powers in short intervals#819835
- Almost $k$-th powers in short intervals#809839
- A variant of Collatz's conjecture over binary polynomials#652780
Record · ID 1084692
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