, X n ) is g-Følner if and only if µ (Xn) = µ (g ?1 Xn) if and only if the shift by g is an isometry
, X n ) is Følner if and only if every shift is an isometry
, If G is finitely generated, then G is amenable if and only if there exists a nondecreasing sequence (X n ) of finite subsets of G such that every shift is an isometry
, Note that one implication of Point 3 was already stated in [Cap09, Theorem 3.5], but the proof contains a confusion between left and right Følner. The full equivalence generalizes
, If (X n ) is the sequence of balls with respect to some generating set of cardinality ?, then every shift is ?-Lipschitz
, G, a nondecreasing exhaustive sequence is g-Følner if and only if all of its subsequences yield a Besicovitch pseudodistance for which the shift by g is continuous
, G is amenable if and only if it admits a nondecreasing exhaustive sequence of finite subsets of which all subsequences yield a Besicovitch distance for which every shift is continuous
Cellular automata in the Cantor, Besicovitch and Weyl spaces, Complex Systems, vol.11, pp.107-123, 1999. ,
URL : https://hal.archives-ouvertes.fr/hal-02101951
Surjunctivity for cellular automata in Besicovitch spaces, Journal of Cellular Automata, vol.4, pp.89-98, 2009. ,
Generalized Besicovitch and Weyl spaces: Topology, patterns, and sliding block codes, Theoretical Computer Science, vol.412, pp.3822-3837, 2011. ,
Surjective cellular automata far from the Garden of Eden, Discrete Mathematics and Theoretical Computer Science, vol.15, pp.41-60, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00966380
Cellular Automata and Groups, 2010. ,
Topics in Geometric Group Theory, 2000. ,
Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.3, pp.320-375, 1969. ,
Cellular Automata : Analysis and Applications, p.0, 2017. ,
Probability and geometry on groups. Lecture notes, 2019. ,
Étude de l'action conjointe d'un automate cellulaire et du décalage: une approche topologique et ergodique, 2006. ,