检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Guang Wang SU Cai Hong HAN Tai Xiang SUN Lue LI
机构地区:[1]Guangxi Key Laboratory Cultivation Base of Cross-border E-commerce Intelligent Information Processing,Guangxi University of Finance and Economics,Nanning 530003,P.R.China [2]College of Information and Statistics,Guangxi University of Finance and Economics,Nanning 530003,P.R.China
出 处:《Acta Mathematica Sinica,English Series》2022年第9期1643-1652,共10页数学学报(英文版)
基 金:Supported NSF of Guangxi(Grant Nos.2022GXNSFAA035552,2020GXNSFAA297010);PYMRBAP for Guangxi CU(Grant No.2021KY0651)。
摘 要:Let D be a dendrite and f be a continuous map on D.Denote by R(f),Ω(f)andω(x,f)the set of recurrent points,the set of non-wandering points and the set ofω-limit points of x under f,respectively.WriteΩ_(k+1)(f)=Ω(f|_(()Ω_(k)(f)))andω^(k+1)(f)=∪_(()x∈ω~k(f))ω(x,f)for any positive integer k,whereΩ_(1)(f)=Ω(f)andω(f)=∪_(x∈D)ω(x,f).ω~m(f)is called the attracting centre of f ifω^(m+1)(f)=ω~m(f).In this paper,we show that if the rank of D is n-1,then we have the following results:(1)ω^(n+2)(f)=ω^(n+1)(f)and the attracting centre of f isω^(n+1)(f);(2)Ω_(n+2)(f)=■and the depth of f is at most n+2.Further,if the set of(n-1)-order accumulation points of Br(D)(the set of branch points of D)is a singleton,thenΩ_(n+1)(f)=■and the depth of f is at most n+1.Besides,we show that there exist a dendrite D_(1)whose rank is n-1 and the set of(n-1)-order accumulation points of Br(D_(1))is a singleton,and a continuous map g on D_(1)such thatω^(n+1)(g)≠ω~n(g)andΩn(f)≠■.
关 键 词:DENDRITE attracting centre DEPTH
分 类 号:O211.4[理学—概率论与数理统计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.99.99