The no-maximizer conjecture for Bergman N-polynomial content
The no-maximizer conjecture for Bergman N-polynomial content
Let be a simply connected Jordan region in the plane. For , let denote the squared distance from to the polynomials of degree at most in . No-maximizer conjecture. For each , there is an such that among all -gons with area , has no maximizer. The conjecture asserts a fundamental difference between Bergman analytic content and Bergman -polynomial content; the paper gives examples and evidence but does not resolve the claim.
Sources & referencesView supporting material
Primary source
Adam Kraus and Brian Simanek, “New Perspectives on Torsional Rigidity and Polynomial Approximations of z-bar”, arXiv:2309.16450 (2023).
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.