Related papers: Amenability and computability

We provide a new characterization of amenability for countable groups, based on frame representations admitting almost invariant vectors. By relaxing the frame inequalities, thereby weakening amenability, we obtain a large class of…

We unify and extend some previous results about cubic ergodic averages and sets of positive density in products of groups. This provides a joint generalization of earlier work of the author in the case of two commuting actions of an…

It is well known that a dense subgroup $G$ of the complex unitary group $U(d)$ cannot be amenable as a discrete group when $d>1$. When $d$ is large enough we give quantitative versions of this phenomenon in connection with certain estimates…

Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…

In this paper we study the satisfiability and solutions of group equations when combinatorial, algebraic and language-theoretic constraints are imposed on the solutions. We show that the solutions to equations with length, lexicographic…

Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2.…

We prove a converse to Myhill's "Garden-of-Eden" theorem and obtain in this manner a characterization of amenability in terms of cellular automata: "A group $G$ is amenable if and only if every cellular automaton with carrier $G$ that has…

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…

We study computable PAC (CPAC) learning as introduced by Agarwal et al. (2020). First, we consider the main open question of finding characterizations of proper and improper CPAC learning. We give a characterization of a closely related…

We study amenability of definable and topological groups. Among our main technical tools is an elaboration on and strengthening of the Massicot-Wagner version of the stabilizer theorem, and some results around measures. As an application we…

Let $G$ be a second countable locally compact groupoid equipped with a Haar system $\lambda$.In this work, we introduce and develop the notion of amenability for continuous unitary representations of $G$, formulated in terms of Hilbert…

This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…

We prove that the approximation conjecture of Luck holds for all amenable groups in the complex group algebra case. This result was previously proved by Dodziuk, Linnell, Mathai, Schick and Yates under the assumption that the group is…

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…

A topological group $G$ is called extremely amenable if every continuous action of $G$ on a compact space has a fixed point. This concept is linked with geometry of high dimensions (concentration of measure). We show that a von Neumann…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…

We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.

In his work on the Farrell-Jones Conjecture, Arthur Bartels introduced the concept of a "finitely $\mathcal{F}$-amenable" group action, where $\mathcal{F}$ is a family of subgroups. We show how a finitely $\mathcal{F}$-amenable action of a…

We show that an \'etale groupoid which is strongly amenable at infinity is amenable whenever its full and reduced $C^*$-algebras coincide.