Solvability of the Gleason problem on a class of bounded pseudoconvex domains
Timothy G. Clos

TL;DR
This paper investigates conditions under which the Gleason problem is solvable on certain bounded pseudoconvex domains, linking it to the finite generation of ideals of bounded holomorphic functions and exploring smooth and Bergman space cases.
Contribution
It establishes that solvability of the bounded ar problem implies finite generation of ideals, extending results to smooth domains and Bergman spaces.
Findings
Finite generation of ideals when ar problem is solvable
Extension of results to smooth boundary domains
Analysis within Bergman space context
Abstract
We show that if a bounded pseudoconvex domain satisfies the solvability of the bounded problem, then the ideal of bounded holomorphic functions vanishing at a point in the domain is finitely generated. We also prove a smooth analog of the main result for bounded pseudoconvex domains with a sufficiently smooth boundary and also consider the Bergman space case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHolomorphic and Operator Theory · Geometry and complex manifolds · Algebraic and Geometric Analysis
