Extensions of Symbolic Rank by Sam Chistolini ’24

Abstract: “We define the classical notion of symbolic rank for binary sequences and then present two reasonable extensions. First we generalize to arbitrary finite alphabets, and then we generalize to more general sequences, often using binary sequences over pairs of natural numbers to motivate our definitions. We then present new results surrounding the dynamical systems associated with infinite words described by these extended definitions.”