Related papers: Algorithmic Randomness For Amenable Groups

Let $G$ be a finitely generated amenable group. We study the space of shifts on $G$ over a given finite alphabet $A$. We show that the zero entropy shifts are generic in this space, and that more generally the shifts of entropy $c$ are…

We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…

Since the work of Ornstein and Weiss in 1987 (J. Analyse Math. 48 (1987)) it has been understood that the natural category for classical ergodic theory would be probability measure preserving actions of discrete amenable groups. A…

It is well known that a dense subgroup $G$ of the complex unitary group $U(d)$ cannot be amenable as a discrete group when $d>1$. When $d$ is large enough we give quantitative versions of this phenomenon in connection with certain estimates…

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…

We prove that if an ergodic action of a countable group on a probability space admits a generating partition having finite Shannon entropy then it admits a finite generating partition.

An instability property of the Birkhoff's ergodic theorem and related asymptotic laws with respect to small violations of algorithmic randomness is studied. The Shannon--McMillan--Breiman theorem and all universal compression schemes are…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…

In this paper we prove a general convergence theorem for almost-additive set functions on unimodular, amenable groups. These mappings take their values in some Banach space. By extending the theory of epsilon-quasi tiling techniques, we set…

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $\epsilon_0 +1$. All except the maximum element of this family…

We introduce a new class of locally compact groups, namely the strongly compactly covered groups, which are the Hausdorff topological groups $G$ such that every element of $G$ is contained in a compact open normal subgroup of $G$. For…

Moore characterized the amenability of automorphism groups of countable ultrahomogeneous structures by a Ramsey-type property. We extend this result to automorphism groups of metric Fra\"iss\'e structures, which encompass all Polish groups.…

In this paper, we introduce the notions of lowerable, D-lowerable, P-lowerable, hereditarily lowerable, and hereditarily uniformly lowerable for countably infinite amenable group actions. We show that a system with finite entropy is…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…

We show that elementary amenable groups, which have a bound on the orders of their finite subgroups, admit a finite dimensional model for the classifying space with virtually cyclic isotropy.

What is the probability that a random UHF algebra is of infinite type? What is the probability that a random simple AI algebra has at most $k$ extremal traces? What is the expected value of the radius of comparison of a random…

A state $\rho=(\rho_n)_{n=1}^{\infty}$ is a sequence such that $\rho_n$ is a density matrix on $n$ qubits. It formalizes the notion of an infinite sequence of qubits. The von Neumann entropy $H(d)$ of a density matrix $d$ is the Shannon…

In 1970, Donald Ornstein proved a landmark result in dynamical systems, viz., two Bernoulli systems with the same entropy are isomorphic except for a measure 0 set. Keane and Smorodinsky gave a finitary proof of this result. They also…