Coding of substitution dynamical systems as shifts of finite type

Autor:	Paul Surer
Přispěvatelé:	Universidade Estadual Paulista (Unesp)
Rok vydání:	2014
Předmět:	Discrete mathematics Dynamical systems theory Applied Mathematics General Mathematics 010102 general mathematics 010103 numerical & computational mathematics Statistical physics 0101 mathematics Special case 01 natural sciences Coding (social sciences) Mathematics
Zdroj:	Scopus Repositório Institucional da UNESP Universidade Estadual Paulista (UNESP) instacron:UNESP
ISSN:	1469-4417 0143-3857
DOI:	10.1017/etds.2014.80
Popis:	Made available in DSpace on 2018-12-11T17:02:52Z (GMT). No. of bitstreams: 0 Previous issue date: 2016-05-01 Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) We develop a theory that allows us to code dynamical systems induced by primitive substitutions continuously as shifts of finite type in many different ways. The well-known prefix-suffix coding turns out to correspond to one special case. We precisely analyse the basic properties of these codings (injectivity, coding of the periodic points, properties of the presentation graph, interaction with the shift map). A lot of examples illustrate the theory and show that, depending on the particular coding, several amazing effects may occur. The results give new insights into the theory of substitution dynamical systems and might serve as a powerful tool for further researches. Departamento de Matemática IBILCE - UNESP Departamento de Matemática IBILCE - UNESP FAPESP: 2009/07744-0
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86ad2f1308d55cde87c4252a6166017d https://doi.org/10.1017/etds.2014.80 Zobrazit plný text záznamu