EVENT DETAILS AND ABSTRACT

Title: Boshernitzan's Bound for Shifts with Eventually Constant Growth
Speaker: Jon Fickenscher
Speaker Info: Princeton University
Brief Description:
Special Note:
Abstract:

In 1985, Boshernitzan showed that a shift with a linear complexity bound must have a finite number of probability invariant ergodic measures. Recently, Van Cyr and Bryna Kra showed this bound to be sharp by producing examples with the appropriate linear complexity growth while admitting the maximum number of ergodic measures. We will discuss shifts of eventually constant complexity growth and show the the bound may already be improved for such shifts. We end with an examination of the potential sharpness of the bound in this case. This is joint work with Michael Damron.