Related papers: Computable Folner sequences of amenable groups
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…
We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…
An explicit family of Folner sets is constructed for some directed groups acting on a rooted tree of sublogarithmic valency by alternate permutations. In the case of bounded valency, these groups were known to be amenable by probabilistic…
As suggested by the title, this paper is a survey of recent results and questions on the collection of computably enumerable sets under inclusion. This is not a broad survey but one focused on the author's and a few others' current…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…
We give the first examples of (non-amenable group) amenable actions on stably finite simple C*-algebras. More precisely, we give such actions for any countable group in an explicit way. The main ingredients of our construction are the full…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…
Erling Folner proved that the amenability or nonamenability of a countable group depends on the complexity of its finite subsets. Complexity has three measures: maximum Folner ratio, optimal cooling function, and minimum cooling norm. Our…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…
In this paper, we show that there is a net for amenable transformation groups like F{\o}lner net for amenable groups and investigate amenability of a transformation group constructed by semidirect product of groups. We introduce inner…
We describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult…
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…
The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…
We study the topological complexities of relative entropy zero extensions acted by countableinfinite amenable groups. Firstly, for a given Folner sequence $\{F_n\}_{n=0}^\infty$, we define respectively the relative entropy dimensions and…