Related papers: Amenability and computability

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…

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…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

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…

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 the connection between amenability, F{\o}lner conditions and the geometry of finitely generated semigroups. Using results of Klawe, we show that within an extremely broad class of semigroups (encompassing all groups, left…

In this paper we study analogues of amenability for topological groups in the context of definable structures. We prove fixed point theorems for such groups. More importantly, we propose definitions for definable actions and continuous…

We study the computably enumerable sets in terms of the: (a) Kolmogorov complexity of their initial segments; (b) Kolmogorov complexity of finite programs when they are used as oracles. We present an extended discussion of the existing…

We define and study notions of amenability and skew-amenability of continuous actions of topological groups on compact topological spaces. Our main motivation is the question under what conditions amenability of a topological group passes…

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…

Let G be a locally compact group, and ZL1(G) be the centre of its group algebra. We show that when $G$ is compact ZL1(G) is not amenable when G is either nonabelian and connected, or is a product of infinitely many finite nonabelian groups.…

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 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…

Recall that a definable group is `definably amenable' if it admits a translation-invariant Keisler measure. We prove a combinatorial characterization of definable amenability for groups definable in NIP theories. More specifically, given a…

Z.-J. Ruan has shown that several amenability conditions are all equivalent in the case of discrete Kac algebras. In this paper, we extend this work to the case of discrete quantum groups. That is, we show that a discrete quantum group,…

We present a general new method for constructing pointwise ergodic sequences on countable groups, which is applicable to amenable as well as to non-amenable groups and treats both cases on an equal footing. The principle underlying the…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

By giving an interesting characterisation of amenable multiplicative unitaries in term of one dimensional representations, we show in a simple way that bicrossproducts of amenable locally compact groups is both amenable and coamenable.