Entire functions of exponential type not vanishing in the half-plane Iz>k, where k>0
Journal Title: Annales Universitatis Mariae Curie-Skłodowska. Sectio A, Mathematica - Year 2017, Vol 71, Issue 1
Abstract
Let P(z) be a polynomial of degree n having no zeros in |z|<k, k≤1, and let Q(z):=znP(1/z). It was shown by Govil that if max|z|=1|P′(z)| and max|z|=1|Q′(z)| are attained at the same point of the unit circle |z|=1, then max|z|=1|P′(z)|≤n/(1+kn)max|z|=1|P(z)|. The main result of the present article is a generalization of Govil's polynomial inequality to a class of entire functions of exponential type.
Authors and Affiliations
Mohamed Hachani
Keywords
Related Articles
- EP ID EP304586
- DOI 10.17951/a.2017.71.1.31
- Views 102
- Downloads 0
Properties of modulus of monotonicity and Opial property in direct sums
We give an example of a Banach lattice with a non-convex modulus of monotonicity, which disproves a claim made in the literature. Results on preservation of the non-strict Opial property and Opial property under passing...
On the existence of connections with a prescribed skew-symmetric Ricci tensor
We study the so-called inverse problem. Namely, given a prescribed skew-symmetric Ricci tensor we find (locally) a respective linear connection.
On generalized Mersenne numbers, their interpretations and matrix generators
In this paper we introduce generalized Mersenne numbers. We shall present some of their interpretations and matrix generators which are very useful for determining identities.
The natural operators of general affine connections into general affine connections
We reduce the problem of describing all Mfm-natural operators transforming general affine connections on m-manifolds into general affine ones to the known description of all GL(Rm)-invariant maps Rm∗⊗Rm→⊗kRm∗⊗⊗kRm for k...
The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
Let T = (V, E) be a 3-uniform linear hypertree. We consider a blow-up hypergraph B[T ]. We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph B[T ] of the hypertree T , w...