Related papers: The triviality problem for profinite completions

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

We give the first examples of closed fibered hyperbolic 3-manifolds whose fundamental groups are distinguished from every other finitely generated, residually finite group by their finite quotients. One of the examples is also the first…

Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…

We consider the structure of classes of curves on a projective simply connected surface for which fundamental groups of the complements admit free quotients having rank greater than one with irreducible components belonging to a selected…

Let $G$ be a group and let $K$ be a commensurated subgroup of $G$. Then there is a totally disconnected, locally compact (t.d.l.c.) group $\hat{G}_K$ that contains the profinite completion of $K$ as an open compact subgroup and also…

We prove that the sign of the Euler characteristic of arithmetic groups with CSP is determined by the profinite completion. In contrast, we construct examples showing that this is not true for the Euler characteristic itself and that the…

We discuss how non-commutative fundamental groups could eventually contribute to algorithms for finding rational points on hyperbolic curves.

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

We show that the covolume of an irreducible lattice in a higher rank semisimple Lie group with the congruence subgroup property is determined by the profinite completion. Without relying on CSP, we additionally show that volume is a…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

We show that a non-trivial, non-central normal subgroup of the braid groups contains a braid whose closure is a hyperbolic knot with arbitrary large genus. This shows that non-faithfulness of a quantum representation implies that the…

In this paper we study obstructions to presentability by products for finitely generated groups. Along the way we develop both the concept of acentral subgroups, and the relations between presentability by products on the one hand, and…

In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…

This paper reproduces the text of a part of the Author's DPhil thesis. It gives a proof of the classification of non-trivial, finite homogeneous geometries of sufficiently high dimension which does not depend on the classification of the…

It is shown that there is $N$ such that there is no algorithm to decide for identities in at most $N$ variables validity in the class of finite modular lattices. This is based on Slobodskoi's result that the Restricted Word Problem is…

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

We describe the groups that have the same holomorph as a finite perfect group. Our results are complete for centerless groups. When the center is non-trivial, some questions remain open. The peculiarities of the general case are illustrated…

Let $p$ be a prime number, and let $k$ be an algebraically closed field of characteristic $p$. We show that the tame fundamental group of a smooth affine curve over $k$ is a projective profinite group. We prove that the fundamental group of…