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

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