Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T15:26:37.094Z Has data issue: false hasContentIssue false

Combinatorics of one-dimensional simple Toeplitz subshifts

Published online by Cambridge University Press:  13 November 2018

DANIEL SELL*
Affiliation:
Friedrich-Schiller-Universität Jena, Institut für Mathematik, 07743 Jena, Germany email daniel.sell@uni-jena.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the repetitivity function are proved. Moreover, a complete description of the de Bruijn graphs of the subshifts is given. Finally, the Boshernitzan condition is characterized in terms of combinatorial quantities, based on a recent result of Liu and Qu [Uniform convergence of Schrödinger cocycles over simple Toeplitz subshift. Ann. Henri Poincaré12(1) (2011), 153–172]. Particular simple characterizations are provided for simple Toeplitz subshifts that correspond to the orbital Schreier graphs of the family of Grigorchuk’s groups, a class of subshifts that serves as the main example throughout the paper.

Information

Type
Original Article
Copyright
© Cambridge University Press, 2018