| 四次多项式填充Julia集的连通性 |
| |
| 引用本文： | 方丽萍,王勇.四次多项式填充Julia集的连通性[J].北京理工大学学报,2006(5):557-561. |
| |
| 作者姓名： | 方丽萍 王勇 |
| |
| 作者单位： | 北京理工大学理学院,北京100081;北京理工大学理学院,北京100081 |
| |
| 基金项目： | 国家自然科学基金资助项目(10271063) |
| |
| 摘 要： | 利用推广了的Branner-Hubbard和Yoccoz的Puzzle技巧研究一类四次多项式f填充Julia集的连通性,得到了f的填充Julia集的一个连通分支是非平凡的(即至少有两个点)充要条件是该分支是周期临界分支,或是某个周期临界分支在f迭代下的逆像.
|
| 关 键 词： | 填充Julia集 连通性 Puzzle 临界环阵 |
| 收稿时间： | 2005/11/24 0:00:00 |
Connectivity of Filled Julia Sets for Quartic Polynomials |
| |
| FANG Li-ping and WANG Yong.Connectivity of Filled Julia Sets for Quartic Polynomials[J].Journal of Beijing Institute of Technology(Natural Science Edition),2006(5):557-561. |
| |
| Authors: | FANG Li-ping and WANG Yong |
| |
| Institution: | School of Science,Beijing Institute of Technology,Beijing 100081,China;School of Science,Beijing Institute of Technology,Beijing 100081,China |
| |
| Abstract: | By the extend Puzzle technique of Branner-Hubbard and Yoccoz to study the filled Julia sets of a kind of quartic polynomials f,obtaining that a connected component of the filled Julia sets is non-trivial(that is,it has two points at least) if and only if it is a periodic critical component,or an inverse image of some periodic critical component under the iteration of f. |
| |
| Keywords: | Julia sets connectivity Puzzle critical tableau |
|
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
| 点击此处可从《北京理工大学学报》下载免费的PDF全文 |
