Yang-Lee零点的Julia集及其Hausdorff维数的连续性

本文研究了Yang-Lee零点的Julia集的复解析动力系统问题.利用网格及共形迭代函数系统的方法,获得了Yang-Lee零点的Julia集及其Hausdorff维数连续性的结果,推广了乔建永教授在文献[1]中的结果,     

Julia集为Jordan曲线（英文）

本文研究了NCP映射的Julia集为Jordan曲线的问题.利用网格和共形迭代函数系统的方法,获得了Julia集在那种情况下为Jordan曲线的一般结果,推广了有理函数的Julia集为Jordan曲线的复解析动力系统方面的结果.     

复空间之间的逆紧全纯映照

本文首先回顾单位圆盘到复平面之间不存在逆紧全纯映照的证明,然后给出这一经典结果在高维情形下的推广,例如,在n维全纯可分离流形的一个相对紧域到Cn之间不存在逆紧全纯映照.本文还研究复空间的某些解析性质在逆紧全纯映照下保持不变,如双曲性、测度双曲性、有界全纯函数的存在性及有界多次调和函数的存在性等.     

螺形映照的新子族

定义了螺形函数的新子族,即ρ次椭圆星形函数和ρ次椭圆形β型螺形函数,并将这些定义推广到多复变数空间中,得到推广的Roper-Suffridge算子在不同空间不同区域上保持ρ次椭圆星形映照和ρ次椭圆形β型螺形映照的性质,由此可以在多复变数空间中构造出许多ρ次椭圆形β型螺形映照.所得结论丰富了对螺形映照子族及推广的Roper-Suffridge算子的研究.     

Zalcman引理在随机迭代函数族动力系统中的应用

本文根据Schwick的思想,利用Zalcman引理讨论了随机迭代函数族动力系统,指出了函数族随机迭代动力系统的Fatou集和函数族衍生半群动力系统的Fatou集定义差别明显但却等价.并获得了如下正规定则,设■上的非线性解析函数,i∈M},其中M为非空指标集,■,若对任意的指标序列σ=(j_1,j_2,…,j_n,…)∈Σ_M,迭代序列■在点z处正规,则函数族■本身在点z处正规.     

B~n上推广的Roper-Suffridge算子的性质

讨论改进后的Roper-Suffridge延拓算子保持双全纯映照子族的性质.借助双全纯映照子族的解析特征及其偏差结论,得到改进后的Roper-Suffridge延拓算子在一定条件下保持α次殆β型螺形映照、α次β型螺形映照、强β型螺形映照的性质,从而得到改进后的算子在一定条件下保持α次殆星形性、α次星形性和强星形性.所得结论为在多复变数空间中构造这些双全纯映照提供了一种新的途径.     

复分析的一个重要研究分支——简介《复解析动力系统》

第一次世界大战期间，Ｐ．Ｆａｔｏｕ和Ｇ．Ｊｕｌｉａ受Ｎｅｗｔｏｎ迭代法以及Ｍｂｉｕｓ变换群的子群的极限集的启发，产生了Ｒｉｅｍａｎｎ球面上复解析动力系统的研究思想．当时，他们运用新的正规族理论（如Ｍｏｎｔｅｌ定理等）于动力系统，证明了一系列非凡、漂亮...     

平面上具有有界Fréchet导数的调和映照单叶半径的精确估计

给定单位圆盘D={z||z|1}上调和映照f(z)=h(z)+g(z),其中h(z)和g(z)为D上的解析函数,满足f(0)=0,λf(0)=1,ΛfΛ.通过引入复参数λ,|λ|=1,本文研究调和映照Fλ(z)=h(z)+λg(z)和解析函数Gλ(z)=h(z)+λg(z)的性质,得到Fλ(z)和Gλ(z)单叶半径的精确估计.作为应用,本文得到单位圆盘D上某些K-拟正则调和映照Bloch常数的更好估计,改进和推广由Chen等人所得的相应结果.     

C~*上复动力系统

本文主要研究f:C~*→C~*全纯函数所形成的复动力系统,其中0,∞是本性奇点,并证明此动力系统具有与有理函数、整函数相同的一些基本性质.主要结果是将Sullivan定理推广到C~*上,并用古典复分析理论证明f的稳定域只有单连通和二连通的,且二连通稳定域最多只有一个.     

超越整函数的某些动力学性质

本文研究了由m个超越整函数{fl,f2,…,fm}生成的随机迭代系统的Fatou集分支的某些动力学性质.运用复动力系统理论与双曲度量理论,得到了随机迭代系统有界Fatou分支不存在的一个判别准则,同时回答了Baker所提出的问题,且给出了随机迭代系统Fatou分支为单连通的一个充分条件,推广了Bergweiler的结果.     

Internal sets and internal functions in Colombeau theory

This paper is devoted to the study of generalized functions as pointwise functions (so-called internal functions) on certain sets of generalized points (so-called internal sets). We treat the case of the Colombeau algebras of generalized functions, for which these notions have turned out to constitute a fundamental technical tool. We provide general foundations for the notion of internal functions and internal sets and prove a saturation principle. Various applications to Colombeau algebras are given.     

Sub-topical functions and plus-co-radiant sets

In this paper, we study sub-topical functions in the framework of abstract convexity and examine the relevant properties such as support sets, polar sets and sub-differentials for these functions. Plus-radiant and plus-co-radiant sets, and their relations with sub-topical functions are studied. Applying sub-topical functions, we present some separation theorems for both plus-radiant and plus-co-radiant sets.     

Strongly internal sets and generalized smooth functions

Based on a refinement of the notion of internal sets in Colombeau's theory, so-called strongly internal sets, we introduce the space of generalized smooth functions, a maximal extension of Colombeau generalized functions. Generalized smooth functions as morphisms between sets of generalized points form a sub-category of the category of topological spaces. In particular, they can be composed unrestrictedly.     

Exclusive and essential sets of implicates of Boolean functions

In this paper we study relationships between CNF representations of a given Boolean function f and certain sets of implicates of f. We introduce two definitions of sets of implicates which are both based on the properties of resolution. The first type of sets, called exclusive sets of implicates, is shown to have a functional property useful for decompositions. The second type of sets, called essential sets of implicates, is proved to possess an orthogonality property, which implies that every CNF representation and every essential set must intersect. The latter property then leads to an interesting question, to which we give an affirmative answer for some special subclasses of Horn Boolean functions.     

E-Convex Sets, E-Convex Functions, and E-Convex Programming

A class of sets and a class of functions called E-convex sets and E-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator E on the sets and domain of definition of the functions. The optimality results for E-convex programming problems are established.     

集合上的递归函数

本文在Ｊｅｎｓｅｎ和Ｋａｒｐ工作的基础上引进了集合上的递归函数的概念．研究了递归集函数的初步性质，讨论了递归集函数与Ｊｅｎｓｅｎ和Ｋａｒｐ定义的原始递归集函数及递归数论函数之间的关系，并给出了ＺＦＣ的可定义集模型上递归集函数的范式定理．     

分担函数集的正规定则

本文将亚纯函数正规性与分担函数集相结合,探讨了亚纯函数族F正规与F中任意两个函数f与g分担函数的个数,f与其导数f'分担函数的个数及函数f的重值的个数三者之间的关系,给出了一个综合判定亚纯函数族正规的充分条件.     

Fenchel Problem of Level Sets

The Fenchel problem of level sets in the smooth case is solved by deducing a new and nice geometric necessary and sufficient condition for the existence of a smooth convex function with the level sets of a given smooth pseudoconvex function. The main theorem is based on a general differential geometric tool, the space of paths defined on smooth manifolds. This approach provides a complete geometric characterization of a new subclass of pseudoconvex functions originating from analytical mechanics and a new view on convexlike and generalized convexlike mappings in image analysis. This paper is dedicated to the memory of Guido Stampacchia. The author thanks K. Balla for assistance in solving the system of differential equations of Example 2.1 and for helpful remarks. This research was supported in part by the Hungarian Scientific Research Fund, Grants OTKA-T043276 and OTKA-T043241, and by CNR, Rome, Italy. An erratum to this article is available at .     

Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets

Covering rough sets generalize traditional rough sets by considering coverings of the universe instead of partitions, and neighborhood-covering rough sets have been demonstrated to be a reasonable selection for attribute reduction with covering rough sets. In this paper, numerical algorithms of attribute reduction with neighborhood-covering rough sets are developed by using evidence theory. We firstly employ belief and plausibility functions to measure lower and upper approximations in neighborhood-covering rough sets, and then, the attribute reductions of covering information systems and decision systems are characterized by these respective functions. The concepts of the significance and the relative significance of coverings are also developed to design algorithms for finding reducts. Based on these discussions, connections between neighborhood-covering rough sets and evidence theory are set up to establish a basic framework of numerical characterizations of attribute reduction with these sets.     

Analytical Linear Inequality Systems and Optimization

In many interesting semi-infinite programming problems, all the constraints are linear inequalities whose coefficients are analytical functions of a one-dimensional parameter. This paper shows that significant geometrical information on the feasible set of these problems can be obtained directly from the given coefficient functions. One of these geometrical properties gives rise to a general purification scheme for linear semi-infinite programs equipped with so-called analytical constraint systems. It is also shown that the solution sets of such kind of consistent systems form a transition class between polyhedral convex sets and closed convex sets in the Euclidean space of the unknowns.