Dynamics and entropy of \mathcal{S}-graph shifts

DOI10.3934/DCDS.2022117MaRDI QIDQ6351129arXivFDO

Authors Travis Dillon

Publication date 12 October 2020

Published in arXiv

Full work available at URL https://doi.org/10.3934/DCDS.2022117

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Symbolic dynamics (37B10) Topological entropy (37B40) Dynamical systems involving maps of trees and graphs (37E25)

arXiv classification

math.DS

Abstract: $S$-gap shifts are a well-studied class of shift spaces, which has led to several proposed generalizations. This paper introduces a new class of shift spaces called $mathcalS$-graph shifts whose essential structure is encoded in a novel way, as a finite directed graph with a set of natural numbers assigned to each vertex. $mathcalS$-graph shifts contain $S$-gap shifts and their generalizations, as well as all vertex shifts and SFTs, as special cases, thereby providing a method to study these shift spaces in a uniform way. The main result in this paper is a formula for the entropy of any $mathcalS$-graph shift, which, by specialization, resolves a problem proposed by Matson and Sattler. A second result establishes an explicit formula for the zeta functions of $mathcalS$-graph shifts. Additionally, we show that every entropy value is obtained by uncountably many $mathcalS$-graph shifts.

This page was built for publication: Dynamics and entropy of $\mathcal{S}$-graph shifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6351129)