Related papers: Algorithmic Randomness For Amenable Groups

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

In this note we state a conjecture that characterizes unital C*-algebras for which the unitary group is amenable as a topological group in the norm topology. We prove the conjecture for simple, separable, stably finite, unital, $\mathcal…

The purpose of this article is to connect the notion of the amenability of a discrete group with a new form of structural Ramsey theory. The Ramsey theoretic reformulation of amenability constitutes a considerable weakening of the Folner…

We investigate when discrete, amenable groups have $C^*$-algebras of real rank zero. While it is known that this happens when the group is locally finite, the converse in an open problem. We show that if $C^*(G)$ has real rank zero, then…

In this paper we generalize Kingman's sub-additive ergodic theorem to a large class of infinite countable discrete amenable group actions.

Let $G$ be a sofic group, and let $\Sigma = (\sigma_n)_{n\geq 1}$ be a sofic approximation to it. For a probability-preserving $G$-system, a variant of the sofic entropy relative to $\Sigma$ has recently been defined in terms of sequences…

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…

We study a uniform, quantitative form of the amenability-hyperfiniteness paradigm for bounded-degree Borel graphs generating countable Borel equivalence relations. We introduce \emph{uniform Borel amenability} and prove that it is…

Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2.…

We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the…

Recently, Glasner, Lin and Meyerovitch gave a first example of a partial invariant order on a certain group that cannot be invariantly extended to an invariant random total order. Using their result as a starting point we prove that any…

We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of…

In this paper we study the action of a countable group $\Gamma$ on the space of orders on the group. In particular, we are concerned with the invariant probability measures on this space, known as invariant random orders. We show that for…

This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…

If $G$ is a Polish group and $\Gamma$ is a countable group, denote by $\Hom(\Gamma, G)$ the space of all homomorphisms $\Gamma \to G$. We study properties of the group $\cl{\pi(\Gamma)}$ for the generic $\pi \in \Hom(\Gamma, G)$, when…

We show that every group $H$ of at most exponential growth with respect to some left invariant metric admits a bi-Lipschitz embedding into a finitely generated group $G$ such that $G$ is amenable (respectively, solvable, satisfies a…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Let $K$ be a spherically complete field with a non-Archimedean valuation. We define a new version of $K-$amenability for discrete groups and show that the Banach $K-$algebra $l^1(G)$ is amenable iff $G$ is $K-$amenable in our sense.

Let $G$ be a countable discrete amenable group which acts continuously on a compact metric space $X$ and let $\mu$ be an ergodic $G-$invariant Borel probability measure on $X$. For a fixed tempered F{\o}lner sequence $\{F_n\}$ in $G$ with…