Related papers: An uncountable ergodic Roth theorem and applicatio…

We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…

We study amenable minimal Cantor systems of free groups arising from the diagonal actions of the boundary actions and certain Cantor systems. It is shown that every virtually free group admits continuously many amenable minimal Cantor…

Two measures of how near an arbitrary function between groups is to being a homomorphism are considered. These have properties similar to conjugates and commutators. The authors show that there is a rich theory based on these structures,…

There has been much interest in generalizing Kesten's criterion for amenability in terms of a random walk to other contexts, such as determining amenability of a deck covering group by the bottom of the spectrum of the Laplacian or entropy…

It is known that, for a positive Dunford-Schwartz operator in a noncommutative $L^p-$space, $1\leq p<\infty$ or, more generally, in a noncommutative Orlicz space with order continuous norm, the corresponding ergodic averages converge…

We state a theorem relating the ergodicity of the action of a given subgroup of the mapping class group of a surface on the character variety, to the asymptotic of its invariant subspaces through the Witten-Reshetikhin-Turaev…

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…

The Shannon-McMillan-Breiman theorem is one of the most important results in information theory, which can describe the random ergodic process, and its proof uses the famous Birkhoff ergodic theorem, so it can be seen that it plays a…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

We prove an extension of the Moore-Schmidt theorem on the triviality of the first cohomology class of cocycles for the action of an arbitrary discrete group on an arbitrary measure space and for cocycles with values in an arbitrary compact…

We prove a measurable version of the Hall marriage theorem for actions of finitely generated abelian groups. In particular, it implies that for free measure-preserving actions of such groups, if two equidistributed measurable sets are…

We give a streamlined proof of the multiplicative ergodic theorem for quasi-compact operators on Banach spaces with a separable dual.

We prove that any countable non-amenable group G admits a free minimal amenable purely infinite action on the non-compact Cantor set. This answers a question of Kellerhals, Monod and R{\o}rdam.

We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…

We consider random walks on countable groups. A celebrated result of Kesten says that the spectral radius of a symmetric walk (whose support generates the group as a semigroup) is equal to one if and only if the group is amenable. We give…

We apply an inductive argument to three theorems of Cantor on (1) the uncountability of infinite binary sequences, (2) the uncountability of real numbers, and (3) the non-equinumerosity of sets with their powersets. This technique proves…

We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural…

Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational…

We give a sufficient condition for a countable group $G$ to possess a probability measure $\mu$ that admits a non-trivial $\mu$-boundary modeled in the space $\mathrm{Sub}_{\mathrm{am}}(G)$ of amenable subgroups of $G$. In particular, for…

For a locally compact second countable group G and a lattice subgroup Gamma, we give an explicit quantitative solution of the lattice point counting problem in general domains in G, provided that i) G has finite upper local dimension, and…