Related papers: Computable Folner sequences of amenable groups

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

The first group of results of this paper concerns the compressibility of finite subgroups of the Cremona groups. The second concerns the embeddability of other groups in the Cremona groups and, conversely, the Cremona groups in other…

We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…

The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets,…

We introduce and study several amenability properties for unitary corepresentations and *-representations of algebraic quantum groups, which may be used to characterize amenability or co-amenability of such groups. As a background for this…

Random graph models are frequently used as a controllable and versatile data source for experimental campaigns in various research fields. Generating such data-sets at scale is a non-trivial task as it requires design decisions typically…

We show that locally solvable subgroups of PLo(I) are countable. Then for each countable ordered set, we construct a locally solvable subgroup of Thompson's Group F. We develop machinery for understanding embeddings from solvable subgroups…

In this paper, a group is called weakly amenable if its left regular representation is not uniformly isolated from the trivial representation. First examples of finitely generated non-amenable weakly amenable groups are constructed.

We investigate the connection between the abelian rank of a countable amenable group and the existence of good averaging sequences (e.g. for the pointwise ergodic theorem). We show that if $G$ is a group of abelian rank $r(G)$ then any…

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…

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

In the present paper our main objective is to extend the notion of $D$-sets in countable amenable groups and to discuss its connection with weak mixing for amenable group actions. Further we prove that *-notions are equivalent in the…

We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…

We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a…

The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…

We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…

Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…

In this note, we construct torsion-free countable, amenable, weakly mixing groups, which answer a question of V. Bergelson. Some results related to verbal subgroups and crystallographic groups are also presented.

We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…