Skip to main content
Log in

Solving the Gleason problem on linearly convex domains

  • Original article
  • Published:
Mathematische Zeitschrift Aims and scope Submit manuscript

Abstract.

Let \(\Omega\) be a bounded, connected linearly convex set in \({\mathbf{C}} ^n\) with \(C^{1+\epsilon}\) boundary. We show that the maximal ideal (both in \(H^{\infty}(\Omega)\)) and \(A^{m}(\Omega), 0 \leq m \leq \infty\)) consisting of all functions vanishing at \(p \in \Omega\) is generated by the coordinate functions \(z_1 - p_1, \ldots, z_n - p_n\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 2 July 2001; in final form: 26 September 2001 / Published online: 28 February 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lemmers, O., Wiegerinck, J. Solving the Gleason problem on linearly convex domains. Math Z 240, 823–834 (2002). https://doi.org/10.1007/s002090100400

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002090100400

Navigation