Skip to main content Accessibility help
×
Home
Hostname: page-component-78dcdb465f-9mfzn Total loading time: 0.296 Render date: 2021-04-15T18:53:26.543Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Computable Følner monotilings and a theorem of Brudno

Published online by Cambridge University Press:  13 November 2020

NIKITA MORIAKOV
Affiliation:
Department of Imaging, Radboud University Medical Center, Geert Grooteplein 10, 6525 GA Nijmegen, The Netherlands Department of Radiation Oncology, Netherlands Cancer Institute, Plesmanlaan 121, 1066 CX Amsterdam, The Netherlands
Corresponding
E-mail address:

Abstract

A theorem of Brudno says that the Kolmogorov–Sinai entropy of an ergodic subshift over $\mathbb {N}$ equals the asymptotic Kolmogorov complexity of almost every word in the subshift. The purpose of this paper is to extend this result to subshifts over computable groups that admit computable regular symmetric Følner monotilings, which we introduce in this work. For every $d \in \mathbb {N}$ , the groups $\mathbb {Z}^d$ and $\mathsf{UT}_{d+1}(\mathbb {Z})$ admit computable regular symmetric Følner monotilings for which the required computing algorithms are provided.

Type
Original Article
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below.

References

Alpeev, . Kolmogorov complexity and entropy of amenable group actions. Preprint, 2018, arXiv:1809.01634.Google Scholar
Brudno, . Topological entropy, and complexity in the sense of A. N. Kolmogorov. Uspehi Mat. Nauk 29(1974), 157158.Google Scholar
Brudno, . Entropy and the complexity of the trajectories of a dynamic system. Tr. Mosk. Mat. Obs. 44(1982), 124149.Google Scholar
Ceccherini-Silberstein, and Coornaert, . Cellular Automata and Groups (Springer Monographs in Mathematics, 44). Springer, Berlin, 2010.CrossRefGoogle Scholar
Glasner, . Ergodic Theory via Joinings ( Mathematical Surveys and Monographs , 101). American Mathematical Society, Providence, RI, 2003.CrossRefGoogle Scholar
Gromov, . Topological invariants of dynamical systems and spaces of holomorphic maps. I. Math. Phys. Anal. Geom. 2(4) (1999), 323415.CrossRefGoogle Scholar
Golodets, and Sinel'shchikov, S. D.. On the entropy theory of finitely-generated nilpotent group actions. Ergod. Th. & Dynam. Sys. 22(6) (2002), 17471771.CrossRefGoogle Scholar
Hedman, . A First Course in Logic ( Oxford Texts in Logic , 1). Oxford University Press, Oxford, 2004.CrossRefGoogle Scholar
Krieger, . Le lemme d’Ornstein-Weiss d’après Gromov. Dynamics, Ergodic Theory, and Geometry ( Mathematical Sciences Research Institute Publications , 54). Cambridge University Press, Cambridge, 2007, pp. 99111.CrossRefGoogle Scholar
Lindenstrauss, . Pointwise theorems for amenable groups. Invent. Math. 146(2) (2001), 259295.CrossRefGoogle Scholar
Lenz, , Schwarzenberger, , and Veselić, . A Banach space-valued ergodic theorem and the uniform approximation of the integrated density of states. Geom. Dedicata 150 (2011), 134.CrossRefGoogle Scholar
Moriakov, . Computable Følner monotilings and a theorem of Brudno I. Preprint, 2015, arXiv:1509.07858.Google Scholar
Moriakov, . Computable Følner monotilings and a theorem of Brudno II. Preprint, 2015, arXiv:1311.0754v4.Google Scholar
Rabin, . Computable algebra, general theory and theory of computable fields. Trans. Amer. Math. Soc. 95(1960), 341360.Google Scholar
Simpson, . Symbolic dynamics: entropy = dimension = complexity. Theory Comput. Syst. 56(3) (2015), 527543.CrossRefGoogle Scholar
Weiss, . Monotileable amenable groups Topology, Ergodic Theory, Real Algebraic Geometry ( American Mathematical Society Translations Series 2 , 202). American Mathematical Society, Providence, RI, 2001, pp. 257262.Google Scholar
Zorin-Kranich, . Return times theorem for amenable groups. Israel J. Math. 204(1) (2014), 8596.CrossRefGoogle Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 9 *
View data table for this chart

* Views captured on Cambridge Core between 13th November 2020 - 15th April 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Computable Følner monotilings and a theorem of Brudno
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Computable Følner monotilings and a theorem of Brudno
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Computable Følner monotilings and a theorem of Brudno
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *