Related papers: Amenability and computability

We extend F{\o}lner's amenability criterion to the realm of general topological groups. Building on this, we show that a topological group $G$ is amenable if and only if its left translation action can be approximated in a uniform manner by…

We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…

We show that if $G$ is an amenable topological group, then the topological group $L^{0}(G)$ of strongly measurable maps from $([0,1],\lambda)$ into $G$ endowed with the topology of convergence in measure is whirly amenable, hence extremely…

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

In his study of amenable unitary representations, M. E. B. Bekka asked if there is an analogue for such representations of the remarkable fixed-point property for amenable groups. In this paper, we prove such a fixed-point theorem in the…

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…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

For a topological group $G$, amenability can be characterized by the amenability of the convolution Banach algebra $L^1(G)$. Here a Banach algebra $A$ is called amenable if every bounded derivation from $A$ into any dual--type…

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

We prove that amenability of a unitary co-representation $U$ of a locally compact quantum group passes to unitary co-representations that weakly contain $U$. This generalizes a result of Bekka, and answers affirmatively a question of…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

Three natural definitions for amenability of general Hopf C^*-algebras (all of them being generalizations of the case of locally compact groups) were given and the relations between them were studied. Moreover, amenability in the situation…

We revisit G. Elek's notion of amenable representation type, where algebras are characterised by every indecomposable module being "almost" the direct sum of modules of bounded dimension. We give a new proof of his result that string…

We provide a general criterion to deduce maximal amenability of von Neumann subalgebras $L\Lambda \subset L\Gamma$ arising from amenable subgroups $\Lambda$ of discrete countable groups $\Gamma$. The criterion is expressed in terms of…

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

Let Gamma be a finitely generated, amenable group. Using an idea of E Ghys, we prove that if Gamma has a nontrivial, orientation-preserving action on the real line, then Gamma has an infinite, cyclic quotient. (The converse is obvious.)…

We develop a semigroup approach to representation theory for pro-Lie groups satisfying suitable amenability conditions. As an application of our approach, we establish a one-to-one correspondence between equivalence classes of unitary…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

Inner amenability is a bridge between amenability of an object and amenability of its operator algebras. It is an open problem of Ananantharman-Delaroche to decide whether all \'etale groupoids are inner amenable. Approximate lattices and…