Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
