Dynamic complexity in a stochastic rationing model (Q2368061): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Akito Matsumoto / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Cem Yalçın Yıldırım / rank | |||
Normal rank |
Revision as of 20:48, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dynamic complexity in a stochastic rationing model |
scientific article |
Statements
Dynamic complexity in a stochastic rationing model (English)
0 references
22 August 1993
0 references
In this paper the author studies the relations between certain restrictions on the arguments of the zeros of tails of power series of a function and the growth of the function. The result obtained in the paper is for the case of finite radius of convergence: `Theorem: Let f have a power series expansion which is convergent in the unit disk. If there exist two tails \(t_{m}(z)\) and \(t_{n}(z)\), \(m \neq n\), such that all zeros of \(t_{m}(z)t_{n}(z)\) lie on a finite system of radii in the unit disk, then \(\log \max\{| f(z)| : | z| =r\} = O({1\over (1-r)^{2}})\) as \(r \to 1\). The main ingredients in the proof are Schottky's theorem and a special case of the Sjöberg-Levinson-Domar log-log theorem. The author also remarks upon improving his earlier results (in \textit{Les séries de puissances dont les restes ont seulement des zéros non-positifs}, C.R. Acad. Sci. Paris, Sér I, Vol. 325 (1997), 1257-1262) for the case of infinite radius of convergence. The results of the paper are shown, by way of examples, to be sharp in the sense of order.
0 references