Related papers: Algorithmic Randomness For Amenable Groups

We investigate an analogue of the L^2-Betti numbers for amenable linear subshifts. The role of the von Neumann dimension shall be played by the topological entropy.

We establish a characterization of amenability for general Hausdorff topological groups in terms of matchings with respect to finite uniform coverings. Furthermore, we prove that it suffices to just consider two-element uniform coverings.…

In this paper, we study several finite approximation properties of topological full groups of group actions on the Cantor set such that free points are dense. Firstly, we establish that for such a distal action $\alpha$ of a countable…

A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…

We introduce a notion of entropy for automorphisms of discrete groups which admit amenable actions on a compact space. This entropy is dual to classical topological entropy in the sense that if G is discrete and abelian then our notion of…

In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…

We prove several results on the permanence of weak amenability and the Haagerup property for discrete quantum groups. In particular, we improve known facts on free products by allowing amalgamation over a finite quantum subgroup. We also…

We analyze the dichotomy amenable/paradoxical in the context of (discrete, countable, unital) semigroups and corresponding semigroup rings. We consider also F{\o}lner's type characterizations of amenability and give an example of a…

This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…

Given a countable discrete amenable virtually orderable group $G$ acting by translations on a $G$-subshift $X \subseteq S^G$ and an absolutely summable potential $\Phi$, we present a set of conditions to obtain a special integral…

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

We introduce the notion of Zimmer amenability for actions of discrete quantum groups on von Neumann algebras. We prove generalizations of several fundamental results of the theory in the noncommutative case. In particular, we give a…

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…

The notion of probability plays an important role in almost all areas of science and technology. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion…

We use ideas from topological dynamics (amenability), combinatorics (structural Ramsey theory) and model theory (Fra\" {i}ss\' e limits) to study closed amenable subgroups $G$ of the symmetric group $S_\infty$ of a countable set, where…

Let G be a countable group. We proof that there is a model companion for the approximate theory of a Hilbert space with a group G of automorphisms. We show that G is amenable if and only if the structure induced by countable copies of the…

In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…

This paper investigates the asymptotic behaviour of the minimal number of generators of finite index subgroups in residually finite groups. We analyze three natural classes of groups: amenable groups, groups possessing an infinite soluble…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…