The Williams conjecture is false for irreducible subshifts
In this important paper the Williams conjecture is proved to be false. According to this conjecture, the shifts of finite type are classified (up to topological conjugacy) by shift equivalence. In [\textit{K. H. Kim} and \textit{F. W. Roush}, J. Am. Math. Soc. 5, 213-215 (1992; Zbl 0749.54013)] a counterexample in the case of reducible shifts of finite type was given. In the paper under review it is shown that the Williams conjecture is false also for irreducible shifts of finite type. The counterexample grows out of the factorization theorem of \textit{K. H. Kim, F. W. Roush} and \textit{J. B. Wagoner} [J. Am. Math. Soc. 5, 191-212 (1992; Zbl 0749.54012)] which states that the SGCC (sign-gyration-compatibility-condition) representation of the automorphism group of a shift of finite type factors through its dimension representation, and by certain explicit formulas. The proof of this theorem allowed the authors to define a certain relative cohomology class whose nontriviality gives a counterexample to Williams conjecture in the irreducible case. A simplification of the original proof of the factorization theorem is also given.
- Local \({\mathcal{P}}\) entropy and stabilized automorphism groups of subshifts
- Corrigendum to: ``\(C^\ast\)-algebras and equivalences for \(C^\ast\)-correspondences
- Strong topological shift equivalence for dynamical systems
- \(C^\ast\)-algebras and equivalences for \(C^\ast\)-correspondences
- Strong shift equivalence and the generalized spectral conjecture for nonnegative matrices
- A cyclic six-term exact sequence for block matrices over a PID
- A categorical invariant of flow equivalence of shifts
- Strong shift equivalence and strong Conley index
- Strong Conley index over a phase space
- Balanced strong shift equivalence, balanced in-splits, and eventual conjugacy
- The publications of Ki Hang Kim
- The work of Kim and Roush in symbolic dynamics
- Mixing shifts of finite type with non-elementary surjective dimension representations
- Path methods for strong shift equivalence of positive matrices
- Williams's Conjecture is False for Reducible Subshifts
- Strong shift equivalence and positive doubly stochastic matrices
- Canonical compactifications for Markov shifts
- The mathematical research of William Parry FRS
- THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
- CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
- The shift equivalence problem.
- \(\mathrm{C}^\ast\)-algebras. Abstracts from the workshop held August 7--13, 2022
- A profinite approach to complete bifix decodings of recurrent languages
- The functor \(K_0^{\operatorname{gr}}\) is full and only weakly faithful
- Lifting morphisms between graded Grothendieck groups of Leavitt path algebras
- Shift equivalences through the lens of Cuntz-Krieger algebras
- Combinatorial \(\ast\)-algebras. Abstracts from the workshop held March 10--15, 2024
- A complete invariant for shift equivalence for Boolean matrices and finite relations
- Classification conjectures for Leavitt path algebras
- Monoids, dynamics and Leavitt path algebras
- Conjugacy and least commutative congruences in semigroups
- Decidability of the isomorphism problem between multidimensional substitutive subshifts
- Unital aligned shift equivalence and the graded classification conjecture for Leavitt path algebras
- Shift equivalence implies flow equivalence for shifts of finite type
- Shift equivalence relations through the Lens of C*-correspondences
- On the structure of multi-layer cellular neural networks
- On some new invariants for shift equivalence for shifts of finite type
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
This page was built for publication: The Williams conjecture is false for irreducible subshifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293369)
