Recurrence near given sets and the complexity of the Casati–Prosen map

Mirko Degli Esposti and Stefano Galatolo

Chaos, Solitons & Fractals, 2005, vol. 23, issue 4, 1275-1284

Abstract: We prove a quantitative recurrence result which allow to estimate the speed of approaching of a generic orbit to the discontinuities of a map. This result is applied to the study of complexity indicators for individual orbits generated by a certain zero-entropy discontinuous maps which are related to polygonal billiards and quantum chaos.

Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077904003789
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:23:y:2005:i:4:p:1275-1284

DOI: 10.1016/j.chaos.2004.06.075

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().