Related papers: Computable Scott sentences and the weak Whitehead …
We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…
Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…
The Donald--Flanigan problem for a finite group H and coefficient ring k asks for a deformation of the group algebra kH to a separable algebra. It is solved here for dihedral groups and for the classical Weyl groups (whose rational group…
Given a computably locally compact Polish space $M$, we show that its 1-point compactification $M^*$ is computably compact. Then, for a computably locally compact group $G$, we show that the Chabauty space $\mathcal S(G)$ of closed…
The Hanf number for a set $S$ of sentences in $L_{\omega_1,\omega}$ (or some other logic) is the least infinite cardinal $\kappa$ such that for all $\varphi\in S$, if $\varphi$ has models in all infinite cardinalities less than $\kappa$,…
In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include…
We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…
Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…
We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…
Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…
We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…
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…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
We show that every finitely generated group admits weak analogues of an invariant expectation, whose existence characterizes exact groups. This fact has a number of applications. We show that Hopf $G$-modules are relatively injective, which…
A group $G$ given by a presentation $G = < \mathcal A \| \mathcal R >$ is called weakly finitely presented if every finitely generated subgroup of $G$, generated by (images of) some words in $\mathcal A^{\pm 1}$, is naturally isomorphic to…
The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word problem embeds in a finitely presented simple group. In this paper, we show that hyperbolic groups satisfy this conjecture, that is, each…
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…