DIMACS - Graduate Student Combinatorics Seminar

Title: The Complexity of Algebraic Numbers

Speaker: Katie McKeon, Rutgers University

Date: Wednesday, February 25, 2015 12:10pm

Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ


The subword complexity of a sequence counts the distinct strings of a given length that are contained within the sequence. We will examine a large class of transcendental numbers through the lens of this complexity function. In particular, we will use the Schmidt Subspace Theorem to prove that the subword complexity of an algebraic number (written as a sequence in some finite integer base) cannot increase too slowly.

Further information can be found at http://math.rutgers.edu/~nhf12/GCS/