The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The Gleason problem is solved on real analytic pseudoconvex domains in . 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 -points as studied by Range and therefore allow local sup-norm estimates for .
Download Results (CSV)