Computations for symbolic substitutions
Dynamical Systems
2017-06-01 v1
Abstract
We provide a survey of results from symbolic dynamics and algebraic topology relating to Grout, a new user-friendly program developed to calculate combinatorial properties and topological invariants of a large class of symbolic substitutions. We study their subshifts (and related spaces) with an emphasis on examples of computations. We implement a check to verify that no counterexample exists to the so-called "strong coincidence conjecture" for a large number of substitutions on three and four letters.
Cite
@article{arxiv.1705.11130,
title = {Computations for symbolic substitutions},
author = {Dan Rust and Scott Balchin},
journal= {arXiv preprint arXiv:1705.11130},
year = {2017}
}
Comments
arXiv admin note: text overlap with arXiv:1512.00398