...
首页> 外文期刊>Ergodic Theory and Dynamical Systems >Random iterations of polynomials of the form z~2 + c_n : connectedness of Julia sets
【24h】

Random iterations of polynomials of the form z~2 + c_n : connectedness of Julia sets

机译:z〜2 + c_n形式的多项式的随机迭代:Julia集的连通性

获取原文
获取原文并翻译 | 示例
           

摘要

For a sequence (c_n) of complex numbers we consider the quadratic polynomials f_(cn) (z):= z~2 + c_n and the sequence (F_n) of iterates F_n := f_(c_n) o ... o f_(c1). The Fatou set F_((c_n)) is by definition the set of all z implied by C-circumflex such that (F_n) is normal in some neighbourhood of z, while the complement of F_((c_n)) is called the Julia set J_((c_n)). The aim of this paper is to study the connectedness of the Julia set J_(c_n)) provided that the sequence (c_n) is bounded and randomly chosen. For example, we prove a necessary and sufficient condition for the connectedness of J_((c_n)) which implies that J_((c_n)) is connected if |c_n | <= 1/4, while it is almost surely disconnected if |c_n| <= #delta# for some #delta# > 1/4.
机译:对于复数序列(c_n),我们考虑二次多项式f_(cn)(z)​​:= z〜2 + c_n且迭代F_n的序列(F_n):= f_(c_n)o ... o f_( c1)。根据定义,Fatou集F _((c_n))是C-抑扬符隐含的所有z的集合,使得(F_n)在z的某个邻域中是正态的,而F _((c_n))的补码称为Julia集J _((c_n))。本文的目的是研究Julia集J_(c_n))的连通性,前提是序列(c_n)有界且是随机选择的。例如,我们证明了J _((c_n))的连通性的充要条件,这意味着如果| c_n |则J _((c_n))被连通。 <= 1/4,而| c_n |几乎可以断定<=#delta#对于某些#delta#> 1/4。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号