Solving the Gleason problem on linearly convex domains
| dc.creator | Lemmers, Oscar | |
| dc.creator | Wiegerinck, Jan | |
| dc.date | 2001-06-27 | |
| dc.date.accessioned | 2026-07-07T04:42:21Z | |
| dc.date.available | 2026-07-07T04:42:21Z | |
| dc.description | Let V be a bounded, connected linearly convex set in C^n with $C^{1+ε}$-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. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/math/0106235 | |
| dc.identifier | http://arxiv.org/abs/math/0106235 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61742 | |
| dc.subject | Complex Variables | |
| dc.subject | 32A38 (Primary) 32F17 (Secondary) | |
| dc.title | Solving the Gleason problem on linearly convex domains | |
| dc.type | text |