Dual Mean Value Conjecture
For every integer and every polynomial of degree satisfying and , there exists a critical point with such that . Equivalently, .
References
Primary source
Additional references
Progress summary
A new result strengthens the best bound in every dimension, but does not settle the conjecture.
The Dual Mean Value Conjecture seeks a universal lower bound for a normalized polynomial at one of its critical points. The full conjecture remains open.
Known results
- The conjecture is proved through degree ; degrees were known earlier, degrees and were proved by Hinkkanen, Kayumov, and Khammatova, and degree was proved in 2023.
- For general degree , the cited universal bound is (Dubinin).
August 2026 stronger lower bound
A paper reported on August 27, 2026, improves Dubinin’s unconditional lower bound for all using logarithmic capacities of polynomial lemniscates; the improvement is strictly stronger but does not solve the conjecture. Separately, Q. Tang’s October 19, 2025 preprint claims the conjecture for all odd polynomials with nonzero linear term, including ; this claim is unverified.
Current status (as of August 2026): The conjecture is settled through degree and has stronger general lower bounds, but remains open in full generality; the odd-polynomial result is unverified.
Solutions 0
No solutions have been posted yet.