UBC Ergodic Theory Seminar: Jacob Richey

  • Date: 12/01/2022
Jacob Richey, UBC,

University of British Columbia


Entropy and letter density for shifts of finite type


Consider all shifts of finite type constrained by a condition on the forbidden set, e.g. only allowing a single forbidden word of fixed length. Which such shifts have the minimum/maximum possible entropy? Among all binary shifts forbidding a single word with a fixed number of 1s, which shifts have the minimum/maximum possible density of 1s (i.e. parry measure of the cylinder set of 1)? I will present old and new results, and many unanswered questions. Symbolic dynamics, probability, and combinatorics will each play a role. Joint work with Brian Marcus.

Other Information: 

Time: 3:00pm Pacific

Location: ESB 4133

Join Zoom Meeting:   


Meeting ID: 671 9126 3546
Passcode: 910066