Related papers: Algorithmically complex residually finite groups

We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed…

We show that every finitely generated residually finite torsion group $G$ embeds in a finitely generated torsion group $\Gamma$ that is residually finite simple. In particular we show the existence of finitely generated infinite torsion…

We give a simple proof of a result originally due to Dimca and Suciu: a group that is both Kaehler and the fundamental group of a closed three-manifold is finite. We also prove that a group that is both the fundamental group of a closed…

We estimate the proportion of several classes of elements in finite classical groups which are readily recognised algorithmically, and for which some power has a large fixed point subspace and acts irreducibly on a complement of it. The…

A complete classification is given of finite groups whose elements are partitioned into three orbits by the automorphism groups, solving the long-standing classification problem initiated by G. Higman in 1963. As a consequence, a…

In [arXiv:1405.6274, Question 5.2 & Question 5.3] Aschenbrenner, Friedl and Wilton ask: (1) Is the equation problem solvable for the fundamental group of any $3$-manifold? and (2) Is the first-order theory of the fundamental group of any…

We construct a family of finitely generated infinite periodic groups. The basic example is a 2-group, called the tetrahedron group. We generalize the construction by suggesting a family of infinite finitely generated dice groups. We provide…

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…

Bumagin-Wise posed the question of whether every countable group can be realised as the outer automorphism group of a finitely generated, residually finite group. We give a partial answer to this problem for recursively presentable groups.

Assuming that every hyperbolic group is residually finite, we prove the congruence subgroup property for mapping class groups of hyperbolic surfaces of finite type. Under the same assumption, it follows that profinitely equivalent…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…

We use the SmallGroups Library to find the finite subgroups of U(3) of order smaller than 512 which possess a faithful three-dimensional irreducible representation. From the resulting list of groups we extract those groups that can not be…

We prove that if the fundamental group of an arbitrary three-manifold -- not necessarily closed, nor orientable -- is a Kaehler group, then it is either finite or the fundamental group of a closed orientable surface.

We prove that if $G$ is a finite simple group, then all irreducible complex representations of $G$ by be realized over the real numbers if and only if every element of $G$ may be written as a product of two involutions in $G$. This follows…

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

Let $G$ be a finite group and $d$ the degree of a complex irreducible character of $G$, then write $|G|=d(d+e)$ where $e$ is a nonnegative integer. We prove that $|G|\leq e^4-e^3$ whenever $e>1$. This bound is best possible and improves on…