Computing automorphism groups of shifts using atypical equivalence classes

Coven, Ethan M.; Quas, Anthony and Yassawi, Reem (2016). Computing automorphism groups of shifts using atypical equivalence classes. Discrete Analysis, 2016(3), article no. 611.

DOI: https://doi.org/10.19086/da.611

Abstract

We study the automorphism group of an infinite minimal shift (X,σ) such that the complexity difference function, p(n+1)− p(n), is bounded. We give some new bounds on Aut(X,σ)/⟨σ⟩ 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. Finally we show that with the same techniques, we are able to compute the set of conjugacies between two such shifts.

Viewing alternatives

Look up in Google Scholar

Download history

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions

Export

About

CORE (COnnecting REpositories)

Recommendations