Characterization of strictly convex domains biholomorphic to a circular domain
نویسندگان
چکیده
منابع مشابه
Composition operators between growth spaces on circular and strictly convex domains in complex Banach spaces
Let $\Omega_X$ be a bounded, circular and strictly convex domain in a complex Banach space $X$, and $\mathcal{H}(\Omega_X)$ be the space of all holomorphic functions from $\Omega_X$ to $\mathbb{C}$. The growth space $\mathcal{A}^\nu(\Omega_X)$ consists of all $f\in\mathcal{H}(\Omega_X)$ such that $$|f(x)|\leqslant C \nu(r_{\Omega_X}(x)),\quad x\in \Omega_X,$$ for some constant $C>0$...
متن کاملWeighted composition operators between growth spaces on circular and strictly convex domain
Let $Omega_X$ be a bounded, circular and strictly convex domain of a Banach space $X$ and $mathcal{H}(Omega_X)$ denote the space of all holomorphic functions defined on $Omega_X$. The growth space $mathcal{A}^omega(Omega_X)$ is the space of all $finmathcal{H}(Omega_X)$ for which $$|f(x)|leqslant C omega(r_{Omega_X}(x)),quad xin Omega_X,$$ for some constant $C>0$, whenever $r_{Omega_X}$ is the M...
متن کاملweighted composition operators between growth spaces on circular and strictly convex domain
let $omega_x$ be a bounded, circular and strictly convex domain of a banach space $x$ and $mathcal{h}(omega_x)$ denote the space of all holomorphic functions defined on $omega_x$. the growth space $mathcal{a}^omega(omega_x)$ is the space of all $finmathcal{h}(omega_x)$ for which $$|f(x)|leqslant c omega(r_{omega_x}(x)),quad xin omega_x,$$ for some constant $c>0$, whenever $r_{omega_x}$ is the m...
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملMinimum Strictly Convex Quadrangulations of Convex
We present a linear{time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear{time algorithm for such decompositions, too. As an application , we consider the problem of constructing a minimum conformal r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1983
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-1983-15167-4