Mathematics > Complex Variables
[Submitted on 13 Oct 2022]
Title:Polynomial Convexity and Polynomial approximations of certain sets in $\mathbb{C}^{2n}$ with non-isolated CR-singularities
View PDFAbstract:In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some $j\in\{1,2,\cdots,n\}.$ We show that under certain condition on $R_{j},$ 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 $\{(z^{m_{1}}_{1},\cdots, z^{m_{n}}_{n}, \bar{z_1}^{m_{n+1}} + R_{1}(z),\cdots, \bar{z_{n}}^{m_{2n}} + R_{n}(z)):z\in \overline{D},m_{j}\in \mathbb{N}, j=1,\cdots,2n\}$ is polynomially convex; and if $\gcd(m_{j},m_{k})=1~~\forall j\not=k,$ the algebra generated by the functions $z^{m_{1}}_{1},\cdots, z^{m_{n}}_{n}, \bar{z_1}^{m_{n+1}} + R_{1},\cdots, \bar{z_{n}}^{m_{2n}} + R_{n}$ is dense in $\mathcal{C}(\overline{D}).$ We prove an analogue of Minsker's theorem over the closed unit polydisc, i.e, if $\gcd(m_{j},m_{k})=1~~\forall j\not=k,$ the algebra $[z^{m_{1}}_{1},\cdots, z^{m_{n}}_{n}, \bar{z_1}^{m_{n+1}},\cdots , \bar{z_{n}}^{m_{2n}};{\overline{\mathbb{D}}^{n}} ]=\mathcal{C}(\overline{\mathbb{D}}^{n}).$ In the process of proving the above results, we also studied the polynomial convexity and approximation of certain graphs.
Submission history
From: Golam Mostafa Mondal [view email][v1] Thu, 13 Oct 2022 17:41:20 UTC (22 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.