【摘要】 利用推广了的Branner-Hubbard和Yoccoz的Puzzle技巧研究一类四次多项式f填充Julia集的连通性,得到了f的填充Julia集的一个连通分支是非平凡的(即至少有两个点)充要条件是该分支是周期临界分支,或是某个周期临界分支在f迭代下的逆像.更多还原

【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.更多还原