Graph and backward asymptotics of the tent map

arxiv(2023)

引用 0|浏览1
暂无评分
摘要
The tent map family is arguably the simplest 1-parametric family of maps with non-trivial dynamics and it is still an active subject of research. In recent works the second author, jointly with J. Yorke, studied the graph and backward limits of S-unimodal maps. In this article we generalize those results to tent-like unimodal maps. By tent-like here we mean maps that share fundamental properties that characterize tent maps, namely unimodal maps without wandering intervals nor attracting cycles and whose graph has a finite number of nodes.
更多
查看译文
关键词
backward asymptotics,graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要