Solving the Gleason problem on linearly convex domains
复变函数
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0106235,
title = {Solving the Gleason problem on linearly convex domains},
author = {Oscar Lemmers and Jan Wiegerinck},
journal= {arXiv preprint arXiv:math/0106235},
year = {2007}
}
备注
9 pages