A formal proof of the Kung–Traub conjecture
For deterministic stationary root-finding methods without memory, the Kung–Traub bound 2^(n-1) for n >= 1 real or complex scalar derivative observations, the bound given by the first group size times the product of one plus each subsequent size for prescribed positive groups, and entire counterexamples, including one real witness defeating every larger real exponent simultaneously. A concrete inverse Hermite method attains 2^(n-1) for n >= 2 on open real intervals and has that exact order on exp(x)-1. Supporting constructions are included.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-20-000006
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-20-000006/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-20-000006/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'