Felix Hausdorff: Gesammelte Werke. Band VI. Geometrie,Raum und Zahl,hg. von M. Epple (Berlin: Springer, 2021). ISBN 978-3-540-77838-7. XX 540 Seiten. 89,99 €

Mathematische Semesterberichte -     

Обобщение регулярны х в круге функций, близ ких к звездным, на случай многих комп лексных переменных И. И. Баврин

LetD denote a bounded complete bicircular domain (centered at (0, 0)) in the space C of two complex variablesz ₁ andz ₁. Extremal problems are treated in the classP _D which is a generalization, to the two complex variables case, of the class of close-to-starlike functions regular in a disc. Our considerations include estimates of the basic functionals, in particular, those specific for the functions of several complex variables; exactness of estimates is considered, as well. For example, we obtain estimates of the functionals $$A_k (D) = \mathop {\sup }\limits_{(z_1 ,z_2 ) \in D} \mathop \sum \limits_{l = 0}^k |a_{k - l,l} |^2 |z_1 |^{2(k - l)} |z_2 |^{2l} ,B_k (D) = \mathop {\sup }\limits_{(z_1 ,z_2 ) \in D} \left| {\mathop \sum \limits_{l = 0}^k a_{k - l,l} z_1^{k - l} z_2^l } \right|,k = 1,2 \ldots .$$ It is also proved that the Carathéodory class is a subclass of the classP _D.     

数学物理学报第九卷总目录 Vol.9,N.1,1989 pp.1-120

关于中子扩散方程的一个变分方法···········································……“”·金星南(1、非定态中子迁移方程的离散纵标—多群逼近论··················……金咸熙陈虹秋(7!有根不可分离平面偶地图的计数···········································,·······……刘彦佩(21)具有内逼近的外近似方法····,·…,’’···········································…     

Book review of Orthogonal Systems and Convolution Operators,Operator Theory: Advances and Applications,Robert L. Ellis and Israel Gohberg,Birkhäuser Verlag,Basel-Boston-Berlin 2003, Volume 140. ISBN 3-7643-6929-9.

In this note we investigate a time-discrete stochastic dynamic programming problem with countable state and action spaces. We introduce an approximation procedure for a numerical solution by decomposition of the state and also of the action space. The minimal value functions and the optimal policies of the Markovian Decision .Processes constructed by clustering of both spaces are calculated by dynamic programming. Bounds for the minimal value functions will be obtained and convergence theorems are proved.