Related papers: The triviality problem for profinite completions

We determine all finite subgroups of simple algebraic groups that have irreducible centralizers - that is, centralizers whose connected component does not lie in a parabolic subgroup.

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

We provide a general algorithm for the computation of the unramified Brauer group of quotients of rational varieties by finite groups.

We prove that hyperbolic 2-bridge knots are determined amongst all compact 3-manifolds by the profinite completions of their knot groups.

We prove that any compact, orientable 3-manifold with empty or toral boundary is profinitely almost rigid among all compact, orientable 3-manifolds. In other words, the profinite completion of its fundamental group determines its…

The article deals with profinite groups in which centralizers are virtually procyclic. Suppose that G is a profinite group such that the centralizer of every nontrivial element is virtually torsion-free while the centralizer of every…

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…

In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…

Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed,…

For any admissible subcategory of the bounded derived category of coherent sheaves on a smooth proper variety, we prove that sections of the canonical bundle impose a strong constraint on the supports of the objects of the subcategory or…

We present a construction that yields infinite families of non-isomorphic semidirect products $N \rtimes F_m$ sharing a specified profinite completion. Within each family, $m \ge 2$ is constant and $N$ is a fixed group. For $m=2$ we can…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

This paper establishes strong profinite rigidity results for K\"ahler groups, showing that certain groups are determined within the class of residually finite K\"ahler groups by their profinite completion. Examples include products of…

We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively…

In this note, we explore the notion of hyperbolicity of topologically finitely generated profinite groups. Some applications to diophantine geometry are suggested and we try to reformulate certain problems in diophantine geometry in terms…

We show that a large multiplicative subgroup of a finite field $\mathbb{F}_q$ cannot be decomposed into $A+A$ or $A+B+C$ nontrivially. We also find new families of multiplicative subgroups that cannot be decomposed as the sum of two sets…

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

In this paper we study the existence of gradings on finite dimensional associative algebras. We prove that a connected algebra $A$ does not have a non-trivial grading if and only if $A$ is basic, its quiver has one vertex, and its group of…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…