Conjecture on polynomial convexity of totally real discs
For every function satisfying for every , the graph disc is polynomially convex; equivalently, its polynomial hull satisfies .
References
- Polynomial convexity and non-polynomial convexity of totally real discs in C^2 — arXiv — Golam Mostafa Mondal
Source: arXiv
Progress summary
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 is with everywhere, then the graph disc 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- 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.