Hostname: page-component-89b8bd64d-n8gtw Total loading time: 0 Render date: 2026-05-13T01:53:06.139Z 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

Abstract

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable