Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polynomially Convex Embeddings of Even-Dimensional Compact Manifolds (1709.00059v2)

Published 31 Aug 2017 in math.CV

Abstract: The totally-real embeddability of any $2k$-dimensional compact manifold $M$ into $\mathbb Cn$, $n\geq 3k$, has several consequences: the genericity of polynomially convex embeddings of $M$ into $\mathbb Cn$, the existence of $n$ smooth generators for the Banach algebra $\mathcal C(M)$, the existence of nonpolynomially convex embeddings with no analytic disks in their hulls, and the existence of special plurisubharmonic defining functions. We show that these results can be recovered even when $n=3k-1$, $k>1$, despite the presence of complex tangencies, thus lowering the known bound for the optimal $n$ in these (related but inequivalent) questions.

Summary

We haven't generated a summary for this paper yet.