Related papers: Computability of F{\o}lner sets
We study the connection between amenability, F{\o}lner conditions and the geometry of finitely generated semigroups. Using results of Klawe, we show that within an extremely broad class of semigroups (encompassing all groups, left…
The main goal of the paper is to present a general model theoretic framework to understand a result of Shalev on probabilistically finite nilpotent groups. We prove that a suitable group where the equation $[x_1,\ldots,x_k]=1$ holds on a…
We introduce the notion of a powerfully solvable group. These are powerful groups possessing an abelian series of a special kind. These groups include in particular the class of powerfully nilpotent groups. We will also see that for a…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…
NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…
In 2005, Borisov and Sapir proved that ascending HNN extensions of finitely generated linear groups are residually finite. Subsequently, Dru\c{t}u and Sapir noted the existence of finitely generated non-linear residually finite groups based…
We prove an inequality, valid on any finitely generated group with a fixed finite symmetric generating set, involving the growth of successive balls, and the average length of an element in a ball. It generalizes recent improvements of the…
We show that amenability of a group acting by homeomorphisms can be deduced from a certain local property of the action and recurrency of the orbital Schreier graphs. This covers amenability of a wide class groups, the amenability of which…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
Let $G$ be a solvable subgroup of the group $\diff{}{n}$ of local complex analytic diffeomorphisms. Analogously as for groups of matrices we bound the solvable length of $G$ by a function of $n$. Moreover we provide the best possible bounds…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…
Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…
We show that every fsg group externally definable in an NIP structure is definably isomorphic to a group interpretable in it. Our proof relies on honest definitions and a group chunk result reconstructing a hyper-definable group from its…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
Commensurable groups are bi-interpretable, under suitable definability conditions.