Related papers: Polycyclic groups and profinite isomorphism

We initiate the study of profinite groups of non-negative deficiency. The principal focus of the paper is to show that the existence of a finitely generated normal subgroup of infinite index in a profinite group $G$ of non-negative…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

We construct an uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions. We also show that word growth rate is not a profinite property.

We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…

We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

We say that a group $G$ is of \textit{profinite type} if it can be realized as a Galois group of some field extension. Using Krull's theory, this is equivalent to the ability of $G$ to be equipped with a profinite topology. We also say that…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

We introduce and investigate a class of profinite groups defined via extensions of centralizers analogous to the extensively studied class of finitely generated fully residually free groups, that is, limit groups (in the sense of Z. Sela).…

We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…

Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

Let G < SL(V) be a finite group, V is finite dimensional over a field F, p=char F and S(V) is the symmetric algebra of V. We determine when the subring of G-invariants S(V)^G is a polynomial ring. As a consequence, we classify, if F is…

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…

We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.

We prove that the profinite completion of the fundamental group of a compact 3-manifold $M$ satisfies a Tits alternative: if a closed subgroup $H$ does not contain a free pro-$p$ subgroup for any $p$, then $H$ is virtually soluble, and…

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has polynomial time decidable subset sum problem. In this paper we use subgroup distortion to show that every…