Related papers: Symbolic dynamics on amenable groups: the entropy …

We survey the connections between entropy, chaos, and independence in topological dynamics. We present extensions of two classical results placing the following notions in the context of symbolic dynamics: 1. Equivalence of positive entropy…

In this paper for a finite field $F$, a nonempty set $\Gamma$, a self--map $\varphi:\Gamma\to\Gamma$ and a weight vector $\mathfrak{w}\in F^\Gamma$, we show that the set--theoretical entropy of the weighted generalized shift…

We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…

We study the thermodynamic formalism for particular types of sub-additive sequences on a class of subshifts over countable alphabets. The subshifts we consider include factors of irreducible countable Markov shifts under certain conditions.…

For a countable amenable group $G$ and a fixed dimension $m\geq 1$, we investigate when it is possible to embed a $G$-space $X$ into the $m$-dimensional cubical shift $([0,1]^m)^G$. We focus our attention on systems that arise as an…

The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…

We give sufficient conditions for a shift space $(\Sigma,\sigma)$ to be intrinsically ergodic, along with sufficient conditions for every subshift factor of $\Sigma$ to be intrinsically ergodic. As an application, we show that every…

We explore properties of the universal terms in the entanglement entropy and logarithmic negativity in 4d CFTs, aiming to clarify the ways in which they behave like the analogous entanglement measures in quantum mechanics. We show that,…

It is shown that each discrete countable infinite amenable group admits a 0-entropy mixing action on a standard probability space.

The set of automorphisms of a one-dimensional \shift $(X, \sigma)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first…

For each finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…

The fundamental inequality of Guivarc'h relates the entropy and the drift of random walks on groups. It is strict if and only if the random walk does not behave like the uniform measure on balls. We prove that, in any nonelementary…

We prove that every dynamical system $X$ with free action of a countable amenable group $G$ by homeomorphisms has a zero-dimensional extension $Y$ which is faithful and principal, i.e. every $G$-invariant measure $\mu$ on $X$ has exactly…

Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

We give the first examples of (non-amenable group) amenable actions on stably finite simple C*-algebras. More precisely, we give such actions for any countable group in an explicit way. The main ingredients of our construction are the full…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend…

Let $G$ be an amenable discrete countable infinite group, $A$ a finite set, and $(\mu_g)_{g\in G}$ a family of probability measures on $A$ such that $\inf_{g\in G}\min_{a\in A}\mu_g(a)>0$. It is shown (among other results) that if the…