Gwen Tadeo (Manilla)

Mixing for Compatible Random Substitutions on Two Letters

Abstract:
A "random" substitution assigns a finite set of words to each letter of an alphabet. We iterate this independently on each letter for a given word. We investigate the topological mixing properties of shift spaces associated with random substitutions on two letters. In particular, we  will derive a precise condition for the topological mixing of these subshifts, generalizing a result of Kenyon, Sadun and Solomyak. If time permits, we will also sketch a proof that the random Fibonacci subshift is topologically mixing.

(Joint work with Dan Rust & Eden Delight P. Miro)


/* */