Nilpotent endomorphisms of expansive group actions | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Nilpotent endomorphisms of expansive group actions

Apparaît dans la collection : Algebraic and Combinatorial Invariants of Subshifts and Tilings / Invariants combinatoires et algébriques des décalages et des pavages

We say a pointed dynamical system is asymptotically nilpotent if every point tends to zero. We study group actions whose endomorphism actions are nilrigid, meaning that for all asymptotically nilpotent endomorphisms the convergence to zero is uniform. We show that this happens for a large class of expansive group actions on a large class of groups. The main examples are cellular automata on subshifts of finite type.

Informations sur la vidéo

Date de captation 12/01/2021
Date de publication 26/01/2021
Institut CIRM
Licence CC BY NC ND
Langue Anglais
Audience Chercheurs
Réalisateur(s) Guillaume Hennenfent
Format MP4

Données de citation

DOI 10.24350/CIRM.V.19697703
Citer cette vidéo Salo, Ville (12/01/2021). Nilpotent endomorphisms of expansive group actions. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19697703
URL https://dx.doi.org/10.24350/CIRM.V.19697703

Domaine(s)

Bibliographie

SALO, Ville et TÖRMÄ, Ilkka. Nilpotent Endomorphisms of Expansive Group Actions. arXiv preprint arXiv:1804.07630, 2018. - https://arxiv.org/abs/1804.07630
TÖRMÄ, Ilkka. A uniquely ergodic cellular automaton. Journal of Computer and System Sciences, 2015, vol. 81, no 2, p. 415-442. - https://dl.acm.org/doi/abs/10.1016/j.jcss.2014.10.001
AANDERAA, Stal O. et LEWIS, Harry R. Linear Sampling and the| forall| exists| forall Case of the Decision Problem. The Journal of Symbolic Logic, 1974, vol. 39, no 3, p. 519-548. - https://projecteuclid.org/euclid.jsl/1183739186
CULIK II, Karel, PACHL, Jan, et YU, Sheng. On the limit sets of cellular automata. SIAM Journal on Computing, 1989, vol. 18, no 4, p. 831-842. - https://doi.org/10.1137/0218057
KARI, Jarkko. The nilpotency problem of one-dimensional cellular automata. siam Journal on Computing, 1992, vol. 21, no 3, p. 571-586. - https://doi.org/10.1137/0221036
JALONEN, Joonatan et KARI, Jarkko. Conjugacy of one-dimensional one-sided cellular automata is undecidable. In : International Conference on Current Trends in Theory and Practice of Informatics. Edizioni della Normale, Cham, 2018. p. 227-238. - https://doi.org/10.1007/978-3-319-73117-9_16
GUILLON, Pierre et RICHARD, Gaétan. Nilpotency and limit sets of cellular automata. In : International Symposium on Mathematical Foundations of Computer Science. Springer, Berlin, Heidelberg, 2008. p. 375-386. - https://doi.org/10.1007/978-3-540-85238-4_30
SALO, Ville. On nilpotency and asymptotic nilpotency of cellular automata. arXiv preprint arXiv:1205.6714, 2012. - https://www.villesalo.com/article/ONaANoCA.pdf

Codes MSC

Document(s)

https://www.cirm-math.fr/RepOrga/2313/Slides/Salo.pdf

Dernières questions liées sur MathOverflow

Pour poser une question, votre compte Carmin.tv doit être connecté à mathoverflow

Poser une question sur MathOverflow

Copyright Carmin.tv 2026

Donner son avis