Quantitative recurrence properties in the historic set for symbolic systems

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.