CASIA OpenIR  > 09年以前成果
An Arc as the inverse limit of a single bonding map of type N on [0,1]
Mo, H; Shi, SQ; Zeng, FP; Mai, JH
发表期刊ACTA MATHEMATICA SINICA-ENGLISH SERIES
2004-10-01
卷号20期号:5页码:925-932
文章类型Article
摘要Let I = [0, 1], c(1), c(2) is an element of (0, 1) with c(1) < c(2) and f : I --> I be a continuous map satisfying: f \([0, c1]) and f\([c2, 1]) are both strictly increasing and f\([c1, c2]) is strictly decreasing. Let A = {x is an element of [0, c(1)]\f(x) = x}, a = maxA, a(1) = max(A\{a}), and B = {x is an element of [c(2), 1]\f(x) = x}, b=minB, b(1) =min(B\{b}). Then the inverse limit (1, f) is an arc if and only if one of the following three conditions holds:
关键词Inverse Limit Arc Uninmodel Map Periodic Point
WOS标题词Science & Technology ; Physical Sciences
收录类别SCI
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Applied ; Mathematics
WOS记录号WOS:000224806000017
引用统计
被引频次:2[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/9980
专题09年以前成果
作者单位1.Shanghai Univ Finance Econ, Dept Appl Math, Shanghai 200433, Peoples R China
2.Chinese Acad Sci, Inst Automat, Key Lab Complex Syst & Intelligent Sci, Beijing 100080, Peoples R China
3.Guangxi Univ, Inst Math, Nanning 530004, Peoples R China
4.Shantou Univ, Inst Math, Shantou 515062, Peoples R China
推荐引用方式
GB/T 7714
Mo, H,Shi, SQ,Zeng, FP,et al. An Arc as the inverse limit of a single bonding map of type N on [0,1][J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES,2004,20(5):925-932.
APA Mo, H,Shi, SQ,Zeng, FP,&Mai, JH.(2004).An Arc as the inverse limit of a single bonding map of type N on [0,1].ACTA MATHEMATICA SINICA-ENGLISH SERIES,20(5),925-932.
MLA Mo, H,et al."An Arc as the inverse limit of a single bonding map of type N on [0,1]".ACTA MATHEMATICA SINICA-ENGLISH SERIES 20.5(2004):925-932.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Mo, H]的文章
[Shi, SQ]的文章
[Zeng, FP]的文章
百度学术
百度学术中相似的文章
[Mo, H]的文章
[Shi, SQ]的文章
[Zeng, FP]的文章
必应学术
必应学术中相似的文章
[Mo, H]的文章
[Shi, SQ]的文章
[Zeng, FP]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。