PreprintarXiv licencearXiv
Combinatorial Search for Strong Shift Equivalence
Abstract
The most important open problem of symbolic dynamics consists in finding a procedure to decide whether two subshifts of finite type are conjugate or, equivalently, whether two nonnegative integer matrices are strong shift equivalent. While the problem remains hard in general, the literature also contains specific examples of matrices that are not known to be strong shift equivalent: the Baker matrices, and Ashley's eight-by-eight. These specific examples have been open for 30 years. Using computer experiments, we show that the Baker matrices are indeed strong shift equivalent for small values of k, and that Ashley's eight-by-eight matrix is indeed strong shift equivalent to the one-by-one matrix 2
Related
- Graded classification of Leavitt path algebras in terms of strong shift equivalence
- On the strong DR/DZ equivalence conjecture
- Entropy and complexity in a strong orbit equivalence class via pseudo-Toeplitz subshifts
- Unmanned Aerial Vehicle Delivery Route Planning in Cold Weather Using Neural Combinatorial Optimization and Adaptive Large Neighborhood Search
- Central Haagerup Tensor Products and Completely Bounded Maps under Strong Morita Equivalence
BibTeX
@misc{jeandel2026combinatorial,
title = {{Combinatorial Search for Strong Shift Equivalence}},
author = {Emmanuel Jeandel},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.03567},
eprint = {2609.03567},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.03567},
}
RIS
TY - UNPB
TI - Combinatorial Search for Strong Shift Equivalence
AU - Emmanuel Jeandel
PY - 2026
DA - 2026/09/03
PB - arXiv
DO - 10.48550/arxiv.2609.03567
UR - https://arxiv.org/abs/2609.03567
AB - The most important open problem of symbolic dynamics consists in finding a procedure to decide whether two subshifts of finite type are conjugate or, equivalently, whether two nonnegative integer matrices are strong shift equivalent. While the problem remains hard in general, the literature also contains specific examples of matrices that are not known to be strong shift equivalent: the Baker matrices, and Ashley's eight-by-eight. These specific examples have been open for 30 years. Using computer experiments, we show that the Baker matrices are indeed strong shift equivalent for small values of k, and that Ashley's eight-by-eight matrix is indeed strong shift equivalent to the one-by-one matrix 2
ER -