paper

Solving the Gleason problem on linearly convex domains

arXiv:math/0106235

Abstract

Let V be a bounded, connected linearly convex set in C^n with -boundary. We show that the maximal ideal (both in A(V) and ) consisting of all functions vanishing at p in V is generated by the coordinate functions z_1 - p_1, ..., z_n - p_n.

9 pages

Solving the Gleason problem on linearly convex domains · wovepaper