Conjugacy of \(Z^2\)-subshifts and textile systems (Q1577249): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2977/prims/1195143225 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045616057 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The decomposition theorem for two-dimensional shifts of finite type / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4169512 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topological conjugacy for sofic systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Notes on a class of tiling problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of subshifts of finite type / rank | |||
Normal rank |
Latest revision as of 12:40, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conjugacy of \(Z^2\)-subshifts and textile systems |
scientific article |
Statements
Conjugacy of \(Z^2\)-subshifts and textile systems (English)
0 references
15 October 2001
0 references
The topological conjugacies of one-dimensional Markov-shifts are classified by Williams strong shift equivalence, an equivalence relation of the adjacency matrices. The author extends this to two dimensions for subshifts of finite type (SFT) using textile shifts. These are special SFTs and it is shown, that any SFT is conjugated to a textile shift. Moreover, topological conjugacies of two-dimensional SFTs are shown to be factorizable into finitely many bipartite codes. For textile shifts, bipartite graphs are associated to each of the factors, which yields the above-mentioned result.
0 references
topological conjugacy
0 references
factorization
0 references
bipartite codes
0 references
shift equivalence
0 references