Related papers: Amenability and computability

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

We define a notion of relative soficity for countable groups with respect to a family of groups. A group is sofic if and only if it is relative sofic with respect to the family consisting only of the trivial group. If a group is relatively…

We consider the amenability of groupoids $G$ equipped with a group valued cocycle $c:G\to Q$ with amenable kernel $c^{-1}(e)$. We prove a general result which implies, in particular, that $G$ is amenable whenever $Q$ is amenable and if…

Building on our previous work, we study the non-relative homology of quantum group convolution algebras. Our main result establishes the equivalence of amenability of a locally compact quantum group $\mathbb{G}$ and 1-injectivity of…

We introduce inner amenability for discrete p.m.p. groupoids and investigate its basic properties, examples, and the connection with central sequences in the full group of the groupoid or central sequences in the von Neumann algebra…

In this paper, we characterize the amenablity of locally compact groups in terms of the properties of the Orlicz Figa-Talamanca Herz algebras.

We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable…

For a locally compact group $G$, let $A(G)$ denote its Fourier algebra, $M_{cb}(A(G))$ the completely bounded multipliers of $A(G)$, and $A_{M_cb}(G)$ the closure of $A(G)$ in $M_{cb}(A(G))$. We show that, if $A_{M_cb}(G)$ is amenable, then…

We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…

We investigate recent uniqueness theorems for reduced $C^*$-algebras of Hausdorff \'{e}tale groupoids in the context of inverse semigroups. In many cases the distinguished subalgebra is closely related to the structure of the inverse…

We answer a question of Downey and Kurtz on left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order.

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

A new flavour of amenability for discrete semigroups is proposed that generalises group amenability and follows from a \Folner-type condition. Some examples are explored, to argue that this new notion better captures some essential ideas of…

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

The class A of countable groups that admit a faithful, transitive, amenable -- in the sense that there is an invariant mean -- action on a set has been widely investigated in the past. In this paper, we no longer require the action to be…

Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors…

We solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. We show that on the other hand, the class of sets which form…

We construct the HNN extension of discrete quantum groups, we study their representation theory and we show that an HNN extension of amenable discrete quantum groups is K-amenable.