← All problems

Conjecture on polynomial convexity of totally real discs

For every function f∈C1(D‾)f\in C^1(\overline{\mathbb D}) satisfying ∣fzˉ(z)∣>∣fz(z)∣|f_{\bar z}(z)|>|f_z(z)| for every z∈D‾z\in\overline{\mathbb D}, the graph disc Γf={(z,f(z)):z∈D‾}⊂C2\Gamma_f=\{(z,f(z)):z\in\overline{\mathbb D}\}\subset\mathbb C^2 is polynomially convex; equivalently, its polynomial hull satisfies Γf^=Γf\widehat{\Gamma_f}=\Gamma_f.

References

Progress summary

Refreshed
Open · progress reported

A new preprint gives a partial negative answer by exhibiting a non-polynomially convex totally real disc inside a strongly pseudoconvex domain, but the full conjecture remains unsettled.

Preskenis conjectured that if ff is C1C^1 with ∣fzˉ∣>∣fz∣|f_{\bar z}|>|f_z| everywhere, then the graph disc {(z,f(z)):z∈D‾}\{(z,f(z)):z\in\overline{\mathbb D}\} is polynomially convex. Duval and O’Farrell–Preskenis are reported to have proved this under the locally direction-reversing hypothesis.

Known results

  • Preskenis proved rational convexity under the locally direction-reversing condition.
  • O’Farrell and Preskenis proved polynomial convexity for degree-−1-1 diffeomorphisms; the later theorem removed the diffeomorphism assumption.
  • Gorai and Mondal (2023) proved polynomial convexity for several totally real discs in Levi-flat hypersurfaces and gave a criterion for discs in the boundary of Hartogs’ triangle.
  • Gorai (2015) gave criteria for totally real graphs and polynomially convex subdiscs in a Wermer example.

Recent partial counterexample

Golam Mostafa Mondal’s preprint supplies a bounded strongly pseudoconvex domain containing a non-polynomially convex totally real disc, while proving positive results for Wermer graphs and a sufficient criterion. This is a partial negative result, not a complete refutation, and has not received independent assessment.

Current status (as of November 2026): The conjecture has a claimed, unverified partial negative result; its full scope and any remaining positive cases are open.

Sources

Solutions 0

No solutions have been posted yet.