The no-maximizer conjecture for Bergman N-polynomial content

Let Ω\Omega be a simply connected Jordan region in the plane. For NNN\in\mathbb N, let ρN(Ω)\rho_N(\Omega) denote the squared distance from zˉ\bar z to the polynomials of degree at most NN in L2(Ω,dA)L^2(\Omega,dA). No-maximizer conjecture. For each NNN\in\mathbb N, there is an nNn\in\mathbb N such that among all nn-gons with area 11, ρN\rho_N has no maximizer. The conjecture asserts a fundamental difference between Bergman analytic content and Bergman NN-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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.