Related papers: Computable Folner sequences of amenable groups

Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the behaviours produced by them under execution, the interaction…

Let H be a countable subgroup of the metrizable compact abelian group G and f:H -> T=R/Z a (not necessarily continuous) character of H. Then there exists a sequence (chi_n)_n of (continuous) characters of G such that lim_n chi_n(alpha) =…

We introduce the notion of indivisible sequences and show that to any indivisible sequence $\{S, \Psi: S \to R\}$ we can associate faithfully flat ring maps $R \to R'$ that are not descendable. As a corollary, we obtain the first example of…

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…

Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…

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…

Clustering ensemble has emerged as an important research topic in the field of machine learning. Although numerous methods have been proposed to improve clustering quality, most existing approaches overlook the need for interpretability in…

We study (relative) $\mathcal K$-Mittag-Leffler modules as was done in the author's habilitation thesis, rephrase old, unpublished results in terms of definable subcategories, and present newer ones, culminating in a characterization of…

We initiate a quantitative study of measure equivalence (and orbit equivalence) between finitely generated groups, which extends the classical setting of $\mathrm L^p$ measure equivalence. In this paper, our main focus will be on amenable…

A countable group is C*-simple if its reduced C*-algebra is a simple algebra. Since Powers recognised in 1975 that non-abelian free groups are C*-simple, large classes of groups which appear naturally in geometry have been identified,…

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 show that an amenable Invariant Random Subgroup of a locally compact second countable group lives in the amenable radical. This answers a question raised in the introduction of the paper "Kesten's Theorem for Invariant Random Subgroup"…

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 study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

This paper is a survey on the works [MS77, MS79, MS81] on maximal subgroups in finitely generated linear groups, and the works that followed it [GG08, GG13b, GG13a, Kap03, Iva92, HO16, GM16, AGS14, Sf90, Sf98, Per05, AKT16, FG18, GS17]…

In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…

A survey of recent results in elementary number theory is presented in this paper. Special attention is given to structure and asymptotic properties of certain families of positive integers.

This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separation. Several computable T3- and Tychonoff separation axioms…