Complex convexity
 | This article may be too technical for most readers to understand. (October 2017) |
Complex convexity is a general term in complex geometry.
Definition
[edit]A set in is called -convex if its intersection with any complex line is contractible.[1][2]
Background
[edit]In complex geometry and analysis, the notion of convexity and its generalizations play an important role in understanding function behavior. Examples of classes of functions with a rich structure are, in addition to the convex functions, the subharmonic functions and the plurisubharmonic functions.
Geometrically, these classes of functions correspond to convex domains and pseudoconvex domains, but there are also other types of domains, for instance lineally convex domains which can be generalized using convex analysis.
A great deal is already known about these domains, but there remain some fascinating, unsolved problems. This theme is mainly theoretical, but there are computational aspects of the domains studied, and these computational aspects are certainly worthy of further study.
References
[edit]- ↑ Andersson, Mats; Passare, Mikael; Sigurdsson, Ragnar (2004), Complex convexity and analytic functionals, Progress in Mathematics, vol. 225, Birkhäuser Verlag, Basel, doi:10.1007/978-3-0348-7871-5, ISBN 3-7643-2420-1, MR 2060426.
- ↑ Nikolov, Nikolai; Pflug, Peter; Zwonek, Włodzimierz (2008). "An Example of a Bounded C-Convex Domain Which is Not Biholomorphic to a Convex Domain". Mathematica Scandinavica. 102 (1): 149–155. doi:10.7146/math.scand.a-15056. JSTOR 24493584.
External links
[edit]- Aizenberg, L.; Passare, M. (2001) [1994], "C-convexity", Encyclopedia of Mathematics, EMS Press
 | This geometry-related article is a stub. You can help Wikipedia by adding missing information. |