Estimating generating partitions of chaotic systems by unstable periodic orbits

An outstanding problem in chaotic dynamics is to specify generating partitions for symbolic dynamics in dimensions larger than 1. It has been known that the infinite number of unstable periodic orbits embedded in the chaotic invariant set provides sufficient information for estimating the generating partition. Here we present a general, dimension-independent, and efficient approach for this task based on optimizing a set of proximity functions defined with respect to periodic orbits. Our algorithm allows us to obtain the approximate location of the generating partition for the Ikeda-Hammel-Jones-Moloney map.