The local polynomial hull near a degenerate CR singularity: Bishop discs revisited
نویسندگان
چکیده
منابع مشابه
The Local Polynomial Hull near a Degenerate Cr Singularity – Bishop Discs Revisited
Let S be a smooth real surface in C and let p ∈ S be a point at which the tangent plane is a complex line. Many problems in function theory depend on knowing whether S is locally polynomially convex at such a p — i.e. at a CR singularity. Even when the order of contact of Tp(S) with S at p equals 2, no clean characterisation exists; difficulties are posed by parabolic points. Hence, we study no...
متن کاملPolynomial Approximation, Local Polynomial Convexity, and Degenerate Cr Singularities
We begin with the following question: given a closed disc D ⋐ C and a complex-valued function F ∈ C(D), is the uniform algebra on D generated by z and F equal to C(D) ? When F ∈ C 1 (D), this question is complicated by the presence of points in the surface S := graph D (F) that have complex tangents. Such points are called CR singularities. Let p ∈ S be a CR singularity at which the order of co...
متن کاملPolynomial Approximation, Local Polynomial Convexity, and Degenerate Cr Singularities
We begin with the following question: given a closed disc D b C and a complexvalued function F ∈ C(D), is the uniform algebra on D generated by z and F equal to C(D) ? When F ∈ C1(D), this question is complicated by the presence of points in the surface S := graphD(F ) that have complex tangents. Such points are called CR singularities. Let p ∈ S be a CR singularity at which the order of contac...
متن کاملLocal Analysis near a Folded Saddle-Node Singularity
Folded saddle-nodes occur generically in one parameter families of singularly perturbed systems with two slow variables. We show that these folded singularities are the organizing centers for two main delay phenomena in singular perturbation problems: canards and delayed Hopf bifurcations. We combine techniques from geometric singular perturbation theory – the blow-up technique – and from delay...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2011
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-011-0902-y