Abstract
The Gleason problem is solved on real analytic pseudoconvex domains in C 2 . In this case the weakly pseudoconvex points can be a two-dimensional subset of the boundary. To reduce the Gleason problem to a ∂ ¯ question it is shown that the set of Kohn-Nirenberg points is at most one-dimensional. In fact, except for a one-dimensional subset, the weakly pseudoconvex boundary points are R-points as studied by Range and therefore allow local sup-norm estimates for ∂ ¯.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
