An internal polya inequality for C-convex domains in C^n

Coefficient problems for univalent and multivalent functions of one complex variable (30C50) Other generalizations of function theory of one complex variable (32A30)

Abstract: Let

K s u b s e t m a t h b b C

be a polynomially convex compact set,

f

be a function analytic in a domain

o v e r l i n e m a t h b b C s m a l l s e t m i n u s K

with Taylor expansion

f l e f t (z i g h t) = s u m_{k = 0}^{i n f t y} f r a c a_{k} z^{k + 1}

at

i n f t y

, and

H_{s} l e f t (f i g h t) := d e t l e f t (a_{k + l} i g h t)_{k, l = 0}^{s}

related Hankel determinants. The classical Polya theorem cite% {P} says that [ limsup_{s ightarrow infty }leftvert H_{s}left( f ight) ightvert ^{1/s^{2}}leq dleft( K ight) , ]% where

d l e f t (K i g h t)

is the transfinite diameter of

K

. The main result of this paper is multivariate internal analogs of Polya's inequality for

m a t h b b C

-convex (=strictly linearly convex) domains

D s u b s e t m a t h b b C^{n}

and weighted Hankel-type determinants, constructed from the Taylor coefficients of a function

f i n A l e f t (D i g h t)

at a given point

% a i n D

; therewith the weights are generated by

s

-indicatrices of the sequence of analytic functionals biorthogonal to the system of monomials in

% m a t h b b C^{n}

. It is proved by the reduction to the outer multivariate analog of Polya's inequality (Zakharyuta, Math. USSR Sbornik, extbf{25 }% (1975)) and is based on the characterization of the strict linear convexity in terms of

s

-indicatrices (S. Znamenskii, Siberian Math. J. extbf{26 } (1985)).

Recommendations

Cites work

Cited in

(2)

This page was built for publication: An internal polya inequality for \(\mathbb{C}\)-convex domains in \(\mathbb{C}^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314099)