Computations for symbolic substitutions
From MaRDI portal
Publication:2963485
zbMATH Open1360.37036arXiv1705.11130MaRDI QIDQ2963485FDOQ2963485
Authors: Scott Balchin, Dan Rust 
Publication date: 14 February 2017
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.
Full work available at URL: https://arxiv.org/abs/1705.11130
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Examples of substitution systems and their factors
- On the Pisot substitution conjecture
- Multidimensional constant-length substitution sequences
- Pure Discrete Spectrum for One-dimensional Substitution Systems of Pisot Type
- Introduction to hierarchical tiling dynamical systems
- A graph approach to computing nondeterminacy in substitutional dynamical systems
- A combinatorial approach to products of Pisot substitutions
- When size matters: subshifts and their related tiling spaces
- Two-symbol Pisot substitutions have pure discrete spectrum
- An algorithm for periodicity and almost periodicity of uniform substitution sequences and its implications on aperiodic spin models
symbolic dynamicstiling space[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=%EF%BF%BD%EF%BF%BDech+cohomology&go=Go ��ech cohomology]Pisot substitution
Cited In (7)
- Symbolic substitutions, Bratteli diagrams and operator algebras
- Periodic points in random substitution subshifts
- Symbolic computation with indexed objects within \texttt{MATHEMATICA}
- Symbolic derivatives without list processing, subroutines, or recursion
- Suffix-connected languages
- Artwork based on automatic sequences
- An algorithm for periodicity and almost periodicity of uniform substitution sequences and its implications on aperiodic spin models
Uses Software
This page was built for publication: Computations for symbolic substitutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963485)
