Quantitative recurrence properties in the historic set for symbolic systems

IF 0.5 4区数学 Q4 MATHEMATICS, APPLIED

Dynamical Systems-An International Journal Pub Date : 2020-12-10 DOI:10.1080/14689367.2020.1855416

Cao Zhao

引用次数: 0

Abstract

Let be a topologically mixing subshift of finite type on an alphabet consisting of m symbols. Let be a continuous function. For a positive function and a continuous positive function , define the sets of recurrence points and In this paper, we give quantitative estimates of the sets of recurrence points, that is, can be expressed by ψ and is the solution of the Bowen equation of topological pressure.

查看原文本刊更多论文

符号系统历史集的定量递归性质

设在由m个符号组成的字母表上的有限型拓扑混合子移位。设为连续函数。对于正函数和连续正函数，定义了递归点集，给出了递归点集的定量估计，即可以用ψ表示，是拓扑压力的Bowen方程的解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Dynamical Systems-An International Journal 物理-力学

CiteScore

0.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Dynamical Systems: An International Journal is a world-leading journal acting as a forum for communication across all branches of modern dynamical systems, and especially as a platform to facilitate interaction between theory and applications. This journal publishes high quality research articles in the theory and applications of dynamical systems, especially (but not exclusively) nonlinear systems. Advances in the following topics are addressed by the journal: •Differential equations •Bifurcation theory •Hamiltonian and Lagrangian dynamics •Hyperbolic dynamics •Ergodic theory •Topological and smooth dynamics •Random dynamical systems •Applications in technology, engineering and natural and life sciences