Solving the Gleason problem on linearly convex domains

Details Solving the Gleason problem on linearly convex domains Solving the Gleason problem on linearly convex domains

2001-06-27

arxiv.org/abs/math/0106235v1

Mathematics

Complex Variables

9 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Solving the Gleason problem on linearly convex domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the Gleason problem on linearly convex domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the Gleason problem on linearly convex domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-406655