Computing automorphism groups of shifts using atypical equivalence classes

From MaRDI portal
Publication:2826232

DOI10.19086/DA.611zbMATH Open1378.54035arXiv1505.02482OpenAlexW2963809654MaRDI QIDQ2826232FDOQ2826232

Ethan Coven, Reem Yassawi, Anthony Quas

Publication date: 10 October 2016

Published in: Discrete Analysis (Search for Journal in Brave)

Abstract: We study the automorphism group of an infinite minimal shift (X,sigma) such that the complexity difference function, p(n+1)p(n), is bounded. We give some new bounds on mboxAut(X,sigma)/langlesigmaangle and also study the one-sided case. For a class of Toeplitz shifts, including the class of shifts defined by constant length primitive substitutions with a coincidence and with height one, we show that the two-sided automorphism group is a cyclic group. We next focus on shifts generated by primitive constant length substitutions. For these shifts, we give an algorithm that computes their two-sided automorphism group, As a corollary we describe how to compute the set of conjugacies between two such shifts.


Full work available at URL: https://arxiv.org/abs/1505.02482





Cites Work


Cited In (18)






This page was built for publication: Computing automorphism groups of shifts using atypical equivalence classes

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