Related papers: The triviality problem for profinite completions

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 show that there is no general algorithm which finds a sequence of points with finite-precision converging computably to the global optima of any continuous function.

A profinite group $G$ is just infinite if every closed normal subgroup of $G$ is of finite index. We prove that an infinite profinite group is just infinite if and only if, for every open subgroup $H$ of $G$, there are only finitely many…

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…

We solve the problem of the classification of perfect quantum codes. We prove that the only nontrivial perfect quantum codes are those with the parameters . There exist no other nontrivial perfect quantum codes.

We prove that a finitely generated group contains a sequence of non-trivial elements which converge to the identity in every compact homomorphic image if and only if the group is not virtually abelian.

A profinite group equipped with an expansive endomorphism is equivalent to a one-sided group shift. We show that these groups have a very restricted structure. More precisely, we show that any such group can be decomposed into a finite…

The article deals with profinite groups in which the centralizers are pronilpotent (CN-groups). It is shown that such groups are virtually pronilpotent. More precisely, let G be a profinite CN-group, and let F be the maximal normal…

We consider the hardness of approximation of optimization problems from the point of view of definability. For many NP-hard optimization problems it is known that, unless P = NP, no polynomial-time algorithm can give an approximate solution…

We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…

We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

We discuss the applications of fundamental groups (of complements of curves) computations (and possibly the computations of the second homotopy group as a model over it) to the classification of algebraic surface. We prove that the…

We investigate which higher rank simple Lie groups admit profinitely but not abstractly commensurable lattices. We show that no such examples exist for the complex forms of type $E_8$, $F_4$, and $G_2$. In contrast, there are arbitrarily…

We show that it is undecidable whether a system of linear equations over the Laurent polynomial ring $\mathbb{Z}[X^{\pm}]$ admit solutions where a specified subset of variables take value in the set of monomials $\{X^z \mid z \in…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

For a positive integer r we prove that if G is a profinite group in which the centralizer of every nontrivial element has rank at most r, then G is either a pro-p group or a group of finite rank. Further, if G is not virtually a pro-p…

We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.

Recently there has been a lot of research and progress in profinite groups. We survey some of the new results and discuss open problems. A central theme is decompositions of finite groups into bounded products of subsets of various kinds…