By Darren Creutz and Ronnie Pavlov

We prove results about subshifts with linear (word) complexity, meaning that *\limsup \frac{p(n)}{n} < \infty*, where for every *n*, *p(n)* is the number of *n*-letter words appearing in sequences in the subshift. Denoting this limsup by *C*, we show that when *C < \frac{4}{3}*, the subshift has discrete spectrum, i.e.... Show more

September 14, 2023

Loading full text...

Similar articles

Loading recommendations...

x1

Low Complexity Subshifts have Discrete Spectrum

Click on play to start listening