Polynomial convexity and polynomial approximations of certain sets in C^2n with non-isolated CR-singularities

From MaRDI portal
Publication:6110397



Abstract: In this paper, we first consider the graph of (F1,F2,cdots,Fn) on overlinemathbbDn, where which has non-isolated CR-singularities if mj>1 for some jin1,2,cdots,n. We show that under certain condition on Rj, the graph is polynomially convex and holomorphic polynomials on the graph approximates all continuous functions. We also show that there exists an open polydisc D centred at the origin such that the set is polynomially convex; and if gcd(mj,mk)=1foralljot=k, the algebra generated by the functions is dense in mathcalC(overlineD). We prove an analogue of Minsker's theorem over the closed unit polydisc, i.e, if gcd(mj,mk)=1foralljot=k, the algebra In the process of proving the above results, we also studied the polynomial convexity and approximation of certain graphs.




Cites work









This page was built for publication: Polynomial convexity and polynomial approximations of certain sets in \(\mathbb{C}^{2n}\) with non-isolated CR-singularities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110397)