Rigorous lower bounds for the topological entropy via a verified optimization technique

Abstract

Our automatic method developed for the detection of chaos is used for finding rigorous lower bounds for the topological entropy of the classical Henon mapping. We do this within the abstract framework created by Galias and Zgliczynski in 2001, and focus on covering graphs involving different iterations. Our results are compared to those obtained by them.