Halvarsson, Stefan A geometric interpretation of the relative order between entire functions. (English) Zbl 0859.32001 Arch. Math. 66, No. 3, 197-206 (1996). The author extends a very refined notion of relative order and type for pairs of entire functions introduced earlier by C. O. Kiselman [Complex analysis, Banach Cent. Publ. 11, 131-141 (1983; Zbl 0585.32019)]. Reviewer: C.A.Berenstein (College Park) MSC: 32A15 Entire functions of several complex variables 32A30 Other generalizations of function theory of one complex variable 30D15 Special classes of entire functions of one complex variable and growth estimates 52A41 Convex functions and convex programs in convex geometry Keywords:growth; convexity; order; type; entire functions Citations:Zbl 0585.32019 PDFBibTeX XMLCite \textit{S. Halvarsson}, Arch. Math. 66, No. 3, 197--206 (1996; Zbl 0859.32001) Full Text: DOI References: [1] S. Halvarsson, Extension of entire functions with controlled growth. Math. Scand.74, 73-97 (1994). · Zbl 0813.32001 [2] S.Halvarsson, Growth properties of entire functions depending on a parameter. Ann. Polon. Math., to appear. · Zbl 0917.32001 [3] C. O.Kiselman, The use of conjugate convex functions in complex analysis. In: Complex Analysis, J. ?awrynowicz and J. Siciak, eds., 131-142, Banach Center Publications, vol. 11, 1983. · Zbl 0585.32019 [4] C. O. Kiselman, Order and type as measures of growth for convex or entire functions. Proc. London Math. Soc. (3)66, 152-186 (1993). · Zbl 0798.32001 · doi:10.1112/plms/s3-66.1.152 [5] R. T.Rockafellar, Convex Analysis. Princeton 1970. · Zbl 0193.18401 [6] W.Rudin, Real and Complex Analysis. 1987. · Zbl 0925.00005 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.