Xu's conjecture on the bound for the recursively defined polynomial
Xu's conjecture on the bound for the recursively defined polynomial
For , let be the recursively defined polynomial in the elementary symmetric functions on the standard simplex , and write for its uniform norm. The theorem in the paper proves the relevant least-deviation equalities for . Xu's norm conjecture. For , one has
Consequently, the equality in the two preceding least-deviation theorems also holds for . The claim is presented as the missing step in extending the proved cases to higher dimensions, and the source gives no proof for .
Sources & referencesView supporting material
Primary source
Yuan Xu, “On polynomials of least deviation from zero in several variables”, arXiv:math/0401416 (2004).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.