论文部分内容阅读
It is proved that every proper holomorphic self-map of a smooth bounded Reinhardt domain in C~2 is an automorphism.
Proper holomorphic self-maps of smooth bounded Reinhardt domains in C~2
【摘 要】
：
It is proved that every proper holomorphic self-map of a smooth bounded Reinhardt domain in C~2 is an automorphism.
【出 处】
：
中国科学：数学英文版
【发表日期】
：
2008年1期
【基金项目】
：
The first author’s work was supported in part by the National Natural Science Foundation of China (Grant No.10571135),the Doctoral Program Foundation of the Ministry of Education of China (Grant No. 2
其他文献
This is a survey of results and open problems concerning the structure of periodic group with prescribed orders of their elements. In particular, an outline of
Interpolation theory is the foundation of finite element methods.In this paper,after reviewing some existed interpolation theorems of anisotropic finite element
Let R be a Gorenstein ring.We prove that if I is an ideal of R such that R/I is a semi-simple ring,then the Gorenstein flat dimension of R/I as a right R-module
Some results about the genus distributions of graphs are known,but little is known about those of digraphs.In this paper,the method of joint trees initiated by
Let φ be a linear fractional self-map of the ball BN with a boundary fixed point e1,we show that1φReφ1(z)～Re(1-z1)holds in a neighborhood of e1 on BN.Applying
Bounds for the bracketing entropy of the classes of bounded k-monotone functions on [0,A] are obtained under both the Hellinger distance and the Lp(Q) distance,
Let Ω RN be a ball centered at the origin with radius R 】 0 and N 7, 2* = 2N/N-2. We obtain the existence of infinitely many radial solutions for the Dirich
A near generalized balanced tournament design, or an NGBTD(k,m) in short, is a (km+1,k,k-1)-BIBD defined on a (km+1)-set V . Its blocks can be arranged into an
In this paper,we mainly use the Galerkin approximation method and the iteration inequalities of the L-Maslov type index theory to study the properties of brake
It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP.