Seminar series
Date
Tue, 12 Feb 2013
Time
14:30 -
15:30
Location
L3
Speaker
Veselin Jungic
Organisation
Simon Fraser University
I will describe how a search for the answer to an old question about the existence of monotone arithmetic progressions in permutations of positive integers led to the study of infinite words with bounded additive complexity. The additive complexity of a word on a finite subset of integers is defined as the function that, for a positive integer $n$, counts the maximum number of factors of length $n$, no two of which have the same sum.