Related papers: Amenability and computability
We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
We give for a compact group G, a full characterisation of when its Fourier algebra A(G) is weakly amenable: when the connected component of the identity G_e is abelian. This condition is also equivalent to the hyper-Tauberian property for…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
Based on the recent development of commutator theory for loops, we provide both syntactic and semantic characterization of abelian normal subloops. We highlight the analogies between well known central extensions and central nilpotence on…
We let the central Fourier algebra, ZA(G), be the subalgebra of functions u in the Fourier algebra A(G) of a compact group, for which u(xyx^{-1})=u(y) for all x,y in G. We show that this algebra admits bounded point derivations whenever G…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
We introduce the notion of tracial amenability for actions of discrete groups on unital, tracial C$^*$-algebras, as a weakening of amenability where all the relevant approximations are done in the uniform trace norm. We characterize tracial…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is \emph{eventual correctness}: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely.…
This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is 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…
In this paper we classify countable locally finite-by-abelian groups up to coarse isomorphism. This classification is derived from a coarse classification of amenable shift-homogeneous metric spaces.
In this paper, we study several finite approximation properties of topological full groups of group actions on the Cantor set such that free points are dense. Firstly, we establish that for such a distal action $\alpha$ of a countable…
As is well known, the equivalence between amenability of a locally compact group $G$ and injectivity of its von Neumann algebra $\mathcal{L}(G)$ does not hold in general beyond inner amenable groups. In this paper, we show that the…